From FOL Require Import FullSyntax Arithmetics Theories.
From Undecidability.Shared Require Import ListAutomation.
From FOL.Tennenbaum Require Import NumberUtils DN_Utils Formulas SyntheticInType Peano CantorPairing.
From FOL.Incompleteness Require Import qdec sigma1 ctq.
Require Import Lia.
Import Vector.VectorNotations.
Notation "x 'el' A" := (List.In x A) (at level 70).
Notation "A '<<=' B" := (List.incl A B) (at level 70).
Notation "x ∣ y" := (exists k, x * k = y) (at level 50).
Definition unary α := bounded 1 α.
Definition binary α := bounded 2 α.
Section Model.
Existing Instance PA_preds_signature.
Existing Instance PA_funcs_signature.
Variable D : Type.
Variable I : interp D.
Definition I' := (Peano.I' I).
Existing Instance I'.
Notation Q := Qeq.
Variable axioms : forall ax, PAeq ax -> forall ρ, sat (Peano.I' I) ρ ax.
Notation "x 'i=' y" := (@i_atom PA_funcs_signature PA_preds_signature D I Eq ([x ; y])) (at level 40).
Notation "'iσ' x" := (@i_func PA_funcs_signature PA_preds_signature D I Succ ([x])) (at level 37).
Notation "x 'i⊕' y" := (@i_func PA_funcs_signature PA_preds_signature D I Plus ([x ; y])) (at level 39).
Notation "x 'i⊗' y" := (@i_func PA_funcs_signature PA_preds_signature D I Mult ([x ; y])) (at level 38).
Notation "'i0'" := (i_func (Σ_funcs:=PA_funcs_signature) (f:=Zero) []) (at level 2) : PA_Notation.
Notation "x 'i⧀' y" := (exists d : D, y = iσ (x i⊕ d) ) (at level 40).
Notation inu := (@inu D I).
Section Facts.
From Undecidability.Shared Require Import ListAutomation.
From FOL.Tennenbaum Require Import NumberUtils DN_Utils Formulas SyntheticInType Peano CantorPairing.
From FOL.Incompleteness Require Import qdec sigma1 ctq.
Require Import Lia.
Import Vector.VectorNotations.
Notation "x 'el' A" := (List.In x A) (at level 70).
Notation "A '<<=' B" := (List.incl A B) (at level 70).
Notation "x ∣ y" := (exists k, x * k = y) (at level 50).
Definition unary α := bounded 1 α.
Definition binary α := bounded 2 α.
Section Model.
Existing Instance PA_preds_signature.
Existing Instance PA_funcs_signature.
Variable D : Type.
Variable I : interp D.
Definition I' := (Peano.I' I).
Existing Instance I'.
Notation Q := Qeq.
Variable axioms : forall ax, PAeq ax -> forall ρ, sat (Peano.I' I) ρ ax.
Notation "x 'i=' y" := (@i_atom PA_funcs_signature PA_preds_signature D I Eq ([x ; y])) (at level 40).
Notation "'iσ' x" := (@i_func PA_funcs_signature PA_preds_signature D I Succ ([x])) (at level 37).
Notation "x 'i⊕' y" := (@i_func PA_funcs_signature PA_preds_signature D I Plus ([x ; y])) (at level 39).
Notation "x 'i⊗' y" := (@i_func PA_funcs_signature PA_preds_signature D I Mult ([x ; y])) (at level 38).
Notation "'i0'" := (i_func (Σ_funcs:=PA_funcs_signature) (f:=Zero) []) (at level 2) : PA_Notation.
Notation "x 'i⧀' y" := (exists d : D, y = iσ (x i⊕ d) ) (at level 40).
Notation inu := (@inu D I).
Section Facts.
We show some facts about standard numbers. Namely:
- If x + y is standard, then so are x and y.
- If x * y ≠ 0 is standard, then so are x and y.
- The embedding of nat into a PA model preserves the order on natural numbers.
- A non-standard number is bigger than any natural number.
Lemma inv_std_add x y :
std (x i⊕ y) -> std x /\ std y.
Proof.
intros [n Hn].
revert Hn. revert x y.
induction n.
- intros ?? H. symmetry in H. apply sum_is_zero in H as [-> ->].
split; exists 0; auto. apply axioms.
- intros. destruct (@zero_or_succ D I axioms x) as [-> | [e ->]].
+ rewrite add_zero in Hn. rewrite <-Hn. split.
exists 0; auto. exists (S n); auto. apply axioms.
+ cbn in *. rewrite add_rec in Hn. apply succ_inj in Hn.
assert (std e /\ std y) as []. now apply IHn.
split; auto.
destruct H as [k <-]. exists (S k); auto.
all: apply axioms.
Qed.
Lemma inv_std_mult_right x y m :
(iσ x) i⊗ y = inu m -> std y.
Proof.
cbn. rewrite mult_rec. intros E.
assert (std (y i⊕ x i⊗ y)) as H%inv_std_add.
exists m; auto. tauto.
apply axioms.
Qed.
Lemma inv_std_mult x y m :
x i⊗ y = inu (S m) -> std x /\ std y.
Proof.
destruct (@zero_or_succ D I axioms x) as [-> | [e ->]],
(@zero_or_succ D I axioms y) as [-> | [d ->]].
+ intros _. split; now exists 0.
+ rewrite mult_zero; auto.
intros []%zero_succ; auto.
+ rewrite mult_zero_r; auto.
intros []%zero_succ; auto.
+ intros E. split.
* eapply inv_std_mult_right.
rewrite mult_comm; auto.
apply E.
* eapply inv_std_mult_right, E.
Qed.
Lemma lt_equiv x y :
x < y <-> inu x i⧀ inu y.
Proof.
assert (x < y <-> exists k, S x + k = y) as H.
split.
- induction y in x |-*; [lia|].
destruct x; intros; [exists y; lia|].
destruct (IHy x) as [k <-]; [lia|].
exists k; lia.
- intros []. lia.
- split.
+ intros [k <-]%H. exists (inu k); cbn.
now rewrite inu_add_hom.
+ intros [k Hk].
assert (std (inu (S x) i⊕ k)) as [_ [l Hl]]%inv_std_add.
* exists y. cbn. now rewrite add_rec.
* rewrite <-Hl in *.
apply H. exists l.
rewrite <-inu_inj, inu_add_hom; cbn;
[now rewrite add_rec, Hk | apply axioms | apply axioms].
Qed.
Lemma num_lt_nonStd n d :
~ std d -> inu n i⧀ d.
Proof.
intros nonStd.
destruct (@trichotomy D I axioms (inu n) d) as [H|[<-|H]]; auto.
all : contradiction nonStd.
- exists n; auto.
- apply lessthen_num in H.
destruct H as [k [? ->]].
exists k; auto.
apply axioms.
Qed.
Lemma num_lt_nonStd_converse d :
(forall n, inu n i⧀ d) -> ~ std d.
Proof.
intros H [n Hn]. rewrite <-Hn in H.
specialize (H (S n)). apply lt_equiv in H. lia.
Qed.
End Facts.
Section Pred.
Context (P : D -> Prop)
(P0 : P i0)
(PS : forall n, P n -> P (iσ n)).
Lemma predicate_equiv :
(forall e, P e) <->
exists φ, unary φ /\
(forall e, P e -> forall ρ, (e .: ρ) ⊨ φ) /\
(forall e, (forall ρ, (e .: ρ) ⊨ φ) -> P e).
Proof.
split.
- intros H.
pose (phi := $0 == $0).
exists phi. split; [|firstorder].
unfold unary; repeat solve_bounds.
- intros [φ (Hφ & H1 & H2)] e.
eapply H2. apply induction.
+ apply axioms.
+ assumption.
+ firstorder.
+ intros d ?%H2%PS. now apply H1.
Qed.
End Pred.
Section Overspill.
Context (alpha : form)
(Halpha : unary alpha)
(nStd : ~ stdModel D).
Corollary Overspill :
(forall e, std e -> (forall rho, (e.:rho) ⊨ alpha) ) ->
~ (forall e, (forall rho, (e.:rho) ⊨ alpha) -> std e ).
Proof.
intros ??. apply nStd.
unfold stdModel. apply predicate_equiv.
- now exists 0.
- intros d [n <-]. now exists (S n).
- exists alpha; auto.
Qed.
Lemma Overspill_DN' :
(forall x, stable (std x)) ->
(forall e, std e -> (forall rho, (e.:rho) ⊨ alpha) ) ->
~ ~ exists e, ~ std e /\ (forall rho, (e.:rho) ⊨ alpha).
Proof.
intros stable_std H1 H2. apply Overspill in H1. apply H1. intros e.
intros H. apply stable_std. intros He. apply H2. now exists e.
Qed.
Lemma on_std_equiv :
(forall n rho, ((inu n).:rho) ⊨ alpha) <->
(forall e, std e -> (forall rho, (e.:rho) ⊨ alpha)).
Proof.
split; intros H.
- intros e [n <-]. apply H.
- intros n. apply H. exists n; reflexivity.
Qed.
Lemma Overspill_DN :
(forall x, stable (std x)) ->
(forall n rho, ((inu n).:rho) ⊨ alpha) ->
~ ~ exists e, ~ std e /\ (forall rho, (e.:rho) ⊨ alpha).
Proof.
intros dne.
setoid_rewrite on_std_equiv.
now apply Overspill_DN'.
Qed.
Lemma DNE_Overspill :
DNE ->
(forall n rho, ((inu n).:rho) ⊨ alpha) ->
exists e, ~ std e /\ (forall rho, (e.:rho) ⊨ alpha).
Proof.
intros dne H.
now apply dne, Overspill_DN.
Qed.
End Overspill.
Coding Lemmas
We assume that we have a formula ψ representing an injective
function which only produces prime numbers.
Variable ψ : form.
Variable Hψ :
binary ψ /\ (forall x, Q ⊢I ∀ ψ[up (num x)..] ↔ $0 == num (Irred x) ).
Definition div e d := exists k : D, e i⊗ k = d.
Definition div_num n (d : D) := exists e, inu n i⊗ e = d.
Definition Div_nat (d : D) := fun n => div_num n d.
Definition div_pi n a := (inu n .: (fun _ => a)) ⊨ (∃ (ψ ∧ ∃ $1 ⊗ $0 == $3)).
Lemma ψ_repr x d rho :
(d .: inu x .: rho) ⊨ ψ <-> d = inu (Irred x).
Proof.
destruct Hψ as (_ & H).
specialize (H x).
apply soundness in H.
specialize (H D I'). cbn -[Q] in H.
setoid_rewrite eval_num in H.
rewrite <-(@switch_up_num D I).
now apply H, sat_Q_axioms.
Qed.
Lemma ψ_equiv n a : div_pi n a <-> div_num (Irred n) a.
Proof.
unfold div_pi. cbn. split.
- intros [d [->%ψ_repr H]]. apply H.
- intros. exists (inu (Irred n)). rewrite ψ_repr. now split.
Qed.
Variable Hψ :
binary ψ /\ (forall x, Q ⊢I ∀ ψ[up (num x)..] ↔ $0 == num (Irred x) ).
Definition div e d := exists k : D, e i⊗ k = d.
Definition div_num n (d : D) := exists e, inu n i⊗ e = d.
Definition Div_nat (d : D) := fun n => div_num n d.
Definition div_pi n a := (inu n .: (fun _ => a)) ⊨ (∃ (ψ ∧ ∃ $1 ⊗ $0 == $3)).
Lemma ψ_repr x d rho :
(d .: inu x .: rho) ⊨ ψ <-> d = inu (Irred x).
Proof.
destruct Hψ as (_ & H).
specialize (H x).
apply soundness in H.
specialize (H D I'). cbn -[Q] in H.
setoid_rewrite eval_num in H.
rewrite <-(@switch_up_num D I).
now apply H, sat_Q_axioms.
Qed.
Lemma ψ_equiv n a : div_pi n a <-> div_num (Irred n) a.
Proof.
unfold div_pi. cbn. split.
- intros [d [->%ψ_repr H]]. apply H.
- intros. exists (inu (Irred n)). rewrite ψ_repr. now split.
Qed.
Coding in the standard model We show that we can potentially get a code representing any
predicate on natural numbers up to some bound.
Lemma Coding_nat' p n :
(forall x, x < n -> p x \/ ~ p x) ->
exists c, forall u,
(u < n -> p u <-> Mod (Irred u) c = 0) /\
(Mod (Irred u) c = 0 -> u < n).
Proof.
intros H. induction n.
- exists 1. intros u. split. lia.
intros [k ]%Mod_divides.
assert (Irred u > 1). apply irred_Irred.
destruct k; lia.
- destruct IHn as [a Ha].
{ intros ??; apply H; lia. }
assert (p n \/ ~ p n) as [p_n | Np_n] by (apply H; lia).
+ exists (a * Irred n). intros u.
assert (u < S n <-> u < n \/ u = n) as -> by lia.
split.
++ intros [| ->]. split.
+++ intros p_u%Ha.
rewrite Mod_mult_hom, p_u.
{ now rewrite Mod0_is_0. }
auto.
+++ intros [|H']%irred_integral_domain.
apply Ha; assumption.
apply irred_Mod_eq, inj_Irred in H'. lia.
all: apply irred_Irred.
+++ intuition. apply Mod_divides.
now exists a.
++ intros [H'|H']%irred_integral_domain.
apply Ha in H'. auto.
apply irred_Mod_eq, inj_Irred in H'. lia.
all: apply irred_Irred.
+ exists a. intros u.
assert (u < S n <-> u < n \/ u = n) as -> by lia.
split.
++ intros Hu. destruct Hu as [| ->].
now apply Ha.
split. now intros ?%Np_n.
intros H'%Ha. lia.
++ intros H'%Ha. tauto.
Qed.
Lemma DN_bounded_lem p n :
~ ~ (forall x, x < n -> p x \/ ~ p x).
Proof.
induction n as [|n IH].
{ DN.ret. lia. }
DN.lem (p n). intros Hn.
DN.bind IH. DN.ret. intros x Hx.
assert (x < n \/ x = n) as [| ->] by lia.
all: auto.
Qed.
Lemma Coding_nat p n :
~ ~ exists c, forall u,
(u < n -> p u <-> Mod (Irred u) c = 0) /\
(Mod (Irred u) c = 0 -> u < n).
Proof.
eapply DN.bind_.
- apply DN_bounded_lem.
- intro. apply DN.ret_, (@Coding_nat' p n); eauto.
Qed.
Lemma Divides_num x y :
div_num x (inu y) <-> Mod x y = 0.
Proof.
split.
- intros [k Hk]. destruct x.
+ cbn in Hk. rewrite mult_zero in Hk.
change i0 with (inu 0) in Hk.
cbn. now apply inu_inj in Hk.
apply axioms.
+ cbn in *. destruct (inv_std_mult_right Hk) as [l <-]. unfold I' in Hk.
rewrite <- inu_I in Hk.
apply Mod_divides. exists l.
change (iσ inu x) with (inu (S x)) in Hk.
rewrite <-inu_mult_hom, inu_inj in Hk. lia.
all: apply axioms.
- intros [k Hk]%Mod_divides.
exists (inu k).
rewrite <-inu_mult_hom, inu_inj. lia.
all: apply axioms.
Qed.
(forall x, x < n -> p x \/ ~ p x) ->
exists c, forall u,
(u < n -> p u <-> Mod (Irred u) c = 0) /\
(Mod (Irred u) c = 0 -> u < n).
Proof.
intros H. induction n.
- exists 1. intros u. split. lia.
intros [k ]%Mod_divides.
assert (Irred u > 1). apply irred_Irred.
destruct k; lia.
- destruct IHn as [a Ha].
{ intros ??; apply H; lia. }
assert (p n \/ ~ p n) as [p_n | Np_n] by (apply H; lia).
+ exists (a * Irred n). intros u.
assert (u < S n <-> u < n \/ u = n) as -> by lia.
split.
++ intros [| ->]. split.
+++ intros p_u%Ha.
rewrite Mod_mult_hom, p_u.
{ now rewrite Mod0_is_0. }
auto.
+++ intros [|H']%irred_integral_domain.
apply Ha; assumption.
apply irred_Mod_eq, inj_Irred in H'. lia.
all: apply irred_Irred.
+++ intuition. apply Mod_divides.
now exists a.
++ intros [H'|H']%irred_integral_domain.
apply Ha in H'. auto.
apply irred_Mod_eq, inj_Irred in H'. lia.
all: apply irred_Irred.
+ exists a. intros u.
assert (u < S n <-> u < n \/ u = n) as -> by lia.
split.
++ intros Hu. destruct Hu as [| ->].
now apply Ha.
split. now intros ?%Np_n.
intros H'%Ha. lia.
++ intros H'%Ha. tauto.
Qed.
Lemma DN_bounded_lem p n :
~ ~ (forall x, x < n -> p x \/ ~ p x).
Proof.
induction n as [|n IH].
{ DN.ret. lia. }
DN.lem (p n). intros Hn.
DN.bind IH. DN.ret. intros x Hx.
assert (x < n \/ x = n) as [| ->] by lia.
all: auto.
Qed.
Lemma Coding_nat p n :
~ ~ exists c, forall u,
(u < n -> p u <-> Mod (Irred u) c = 0) /\
(Mod (Irred u) c = 0 -> u < n).
Proof.
eapply DN.bind_.
- apply DN_bounded_lem.
- intro. apply DN.ret_, (@Coding_nat' p n); eauto.
Qed.
Lemma Divides_num x y :
div_num x (inu y) <-> Mod x y = 0.
Proof.
split.
- intros [k Hk]. destruct x.
+ cbn in Hk. rewrite mult_zero in Hk.
change i0 with (inu 0) in Hk.
cbn. now apply inu_inj in Hk.
apply axioms.
+ cbn in *. destruct (inv_std_mult_right Hk) as [l <-]. unfold I' in Hk.
rewrite <- inu_I in Hk.
apply Mod_divides. exists l.
change (iσ inu x) with (inu (S x)) in Hk.
rewrite <-inu_mult_hom, inu_inj in Hk. lia.
all: apply axioms.
- intros [k Hk]%Mod_divides.
exists (inu k).
rewrite <-inu_mult_hom, inu_inj. lia.
all: apply axioms.
Qed.
Coding in an arbitrary model, up to some bound. By using the coding lemma for natural numbers, we can now
similarly verify that formulas can be coded in arbitrary models
of PA. Here, we show this for unary and binary formulas.
Lemma Coding_model_unary α :
unary α ->
forall n rho, rho ⊨
¬ ¬ ∃ ∀ $0 ⧀ (num n) → α ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3).
Proof.
intros unary_α n rho. cbn.
apply (@DN_chaining _ _
(@Coding_nat (fun (n:nat) => forall rho, rho ⊨ α[(num n)..] ) n)).
apply DN.
intros [a Ha].
exists (inu a).
intros u' Hu. cbn in Hu.
rewrite num_subst in Hu.
setoid_rewrite eval_num in Hu.
apply lessthen_num in Hu. 2: apply axioms.
destruct Hu as [u [Hu ->]]. split.
+ intros α_u.
exists (inu (Irred u)).
split; [now apply ψ_repr| ].
apply Divides_num.
apply Ha; [apply Hu|].
intros ?. pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite switch_num.
eapply bound_ext; [apply unary_α| |apply α_u].
intros []; try lia; reflexivity.
+ intros [d [->%ψ_repr H]].
eapply Divides_num, (proj1 (Ha u)) in H; auto.
pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite <- switch_num.
apply H.
Qed.
Lemma Coding_model_binary α :
binary α ->
forall n rho, rho ⊨
∀ ¬ ¬ ∃ ∀ $0 ⧀ (num n) → α[$0 .: $2 ..] ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3).
Proof.
intros binary_α n rho b. cbn.
apply (@DN_chaining _ _
(@Coding_nat (fun n => forall rho, (b .: rho) ⊨ α[(num n)..] ) n)), DN.
intros [a Ha].
exists (inu a).
intros u' Hu. cbn in Hu.
rewrite num_subst in Hu.
setoid_rewrite eval_num in Hu.
apply lessthen_num in Hu. 2: apply axioms.
destruct Hu as [u [Hu ->]]. split.
+ intros α_u.
exists (inu (Irred u)).
split; [now apply ψ_repr| ].
apply Divides_num.
apply Ha; [apply Hu|].
intros ?. pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite switch_num.
rewrite sat_comp in α_u.
eapply bound_ext. eauto.
2 : apply α_u.
intros [|[]]; now cbn; try lia.
+ intros [d [->%ψ_repr H]].
eapply Divides_num, (proj1 (Ha u)) in H; auto.
pose (@switch_num D I) as switch_num. cbn in switch_num.
rewrite switch_num in H. rewrite sat_comp.
eapply bound_ext. eauto.
2 : apply H.
intros [|[]]; now cbn; try lia.
Unshelve. intros _. exact i0.
Qed.
Section notStd.
unary α ->
forall n rho, rho ⊨
¬ ¬ ∃ ∀ $0 ⧀ (num n) → α ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3).
Proof.
intros unary_α n rho. cbn.
apply (@DN_chaining _ _
(@Coding_nat (fun (n:nat) => forall rho, rho ⊨ α[(num n)..] ) n)).
apply DN.
intros [a Ha].
exists (inu a).
intros u' Hu. cbn in Hu.
rewrite num_subst in Hu.
setoid_rewrite eval_num in Hu.
apply lessthen_num in Hu. 2: apply axioms.
destruct Hu as [u [Hu ->]]. split.
+ intros α_u.
exists (inu (Irred u)).
split; [now apply ψ_repr| ].
apply Divides_num.
apply Ha; [apply Hu|].
intros ?. pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite switch_num.
eapply bound_ext; [apply unary_α| |apply α_u].
intros []; try lia; reflexivity.
+ intros [d [->%ψ_repr H]].
eapply Divides_num, (proj1 (Ha u)) in H; auto.
pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite <- switch_num.
apply H.
Qed.
Lemma Coding_model_binary α :
binary α ->
forall n rho, rho ⊨
∀ ¬ ¬ ∃ ∀ $0 ⧀ (num n) → α[$0 .: $2 ..] ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3).
Proof.
intros binary_α n rho b. cbn.
apply (@DN_chaining _ _
(@Coding_nat (fun n => forall rho, (b .: rho) ⊨ α[(num n)..] ) n)), DN.
intros [a Ha].
exists (inu a).
intros u' Hu. cbn in Hu.
rewrite num_subst in Hu.
setoid_rewrite eval_num in Hu.
apply lessthen_num in Hu. 2: apply axioms.
destruct Hu as [u [Hu ->]]. split.
+ intros α_u.
exists (inu (Irred u)).
split; [now apply ψ_repr| ].
apply Divides_num.
apply Ha; [apply Hu|].
intros ?. pose (@switch_num D I) as switch_num.
cbn in switch_num. rewrite switch_num.
rewrite sat_comp in α_u.
eapply bound_ext. eauto.
2 : apply α_u.
intros [|[]]; now cbn; try lia.
+ intros [d [->%ψ_repr H]].
eapply Divides_num, (proj1 (Ha u)) in H; auto.
pose (@switch_num D I) as switch_num. cbn in switch_num.
rewrite switch_num in H. rewrite sat_comp.
eapply bound_ext. eauto.
2 : apply H.
intros [|[]]; now cbn; try lia.
Unshelve. intros _. exact i0.
Qed.
Section notStd.
Coding in a non-standard model
Above we have established coding results for arbitrary PA models.
We will now focus on the special case where the model is not
standard. Using Overspill we can eliminate the bound on the
coding; in a non-standard model, we can find elements which code
the entirety of a predicate.
Variable notStd : ~ stdModel D.
Variable stable_std : forall x, stable (std x).
Theorem Coding_nonStd_unary α :
unary α ->
~ ~ exists c, forall u rho, (inu u .: c .: rho) ⊨
(α ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3)).
Proof.
intros unary_α.
specialize (@Coding_model_unary _ unary_α) as H.
assert (forall n rho, (inu n .: rho) ⊨
¬ ¬ ∃ ∀ $0 ⧀ $2 → α ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3) ) as H'.
- intros n rho. pose (@switch_num D I) as switch_num.
cbn in switch_num.
rewrite <-switch_num. cbn -[sat].
specialize (H n rho).
rewrite !num_subst in *.
assert (ψ[var] = ψ[up (up (up (num n)..))] ) as <-.
{ eapply bounded_subst. 1: apply Hψ.
intros [|[]]; try now intros. }
assert (α[var] = α[up (up (num n)..)] ) as E.
{ eapply bounded_subst. 1: apply unary_α.
intros []; try now intros. }
setoid_rewrite <-E. rewrite !subst_var.
rewrite unfold_sless, !num_subst in *.
apply H.
- apply Overspill_DN in H'; auto.
2 : { unfold unary. solve_bounds.
all: eapply bounded_up; try apply binary_α; try apply Hψ.
all: eauto; lia. }
rewrite <-NNN_N.
apply (DN_chaining H'), DN. clear H' H.
intros (e & He1 & He2).
specialize (He2 (fun _ => i0)).
cbn in He2. apply (DN_chaining He2), DN.
intros [a Ha].
exists a. intros n rho.
assert (inu n i⧀ e) as Hne; [now apply num_lt_nonStd|].
specialize (Ha _ Hne) as [Ha1 Ha2].
split; cbn.
+ intros H. destruct Ha1 as [d Hd].
eapply bound_ext. apply unary_α. 2: apply H.
intros []; try now intros.
exists d. split.
eapply bound_ext. apply Hψ. 2: apply Hd.
intros [|[]]; try now intros.
apply Hd.
+ intros [k Hk].
eapply bound_ext. apply unary_α. 2: apply Ha2.
intros []; try now intros.
exists k. split.
eapply bound_ext. apply Hψ. 2: apply Hk.
intros [|[]]; try now intros.
apply Hk.
Qed.
Theorem Coding_nonstd_binary α :
binary α ->
forall e, ~ ~ exists c, forall u ρ, (inu u .: e .: c .: ρ) ⊨
(α ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $4)).
Proof.
intros binary_α.
assert (forall n rho, (inu n .: rho) ⊨
∀ ¬ ¬ ∃ ∀ $0 ⧀ $3 → α[$0 .: $2..] ↔ ∃ (ψ ∧ ∃ $1 ⊗ $0 == $3)) as H'.
- intros n ρ.
specialize (@Coding_model_binary _ binary_α n ρ) as H.
fold sat in H.
rewrite <-(@switch_num D I). cbn -[sat].
rewrite !num_subst.
assert (ψ[var] = ψ[up (up (up (up (num n)..)))] ) as <-; [shelve|].
assert (α[$0 .: $2..][var] = α[$0 .: $2..][up (up (up (num n)..))] ) as E; [shelve|].
rewrite <-E, !subst_var.
rewrite unfold_sless, !num_subst in *.
apply H.
- apply Overspill_DN in H'; auto; [|shelve].
intros e. DN.bind H'. destruct H' as [e' [He' Hcoded]].
specialize (Hcoded (fun _ => e') e); fold sat in Hcoded.
change
((e .: e' .: (fun _ : nat => e')) ⊨ (¬ (¬ (∃ (∀ $0 ⧀ $3 → α[$0 .: $2..] ↔ (∃ ψ ∧ (∃ $1 ⊗ $0 == $3)))))))
with
(~ ~ (e .: e' .: (fun _ : nat => e')) ⊨ (∃ (∀ $0 ⧀ $3 → α[$0 .: $2..] ↔ (∃ ψ ∧ (∃ $1 ⊗ $0 == $3)))))
in Hcoded.
DN.bind Hcoded. DN.ret.
destruct Hcoded as [c Hc].
exists c. intros u ρ.
unshelve refine (let Hc' := Hc (inu u) _ in _); fold sat in *.
{ cbn. now apply num_lt_nonStd. }
specialize Hc' as [H1 H2].
split.
+ intros Ha. destruct H1 as [k Hk]; fold sat.
* apply sat_comp. eapply bound_ext; [eauto| |apply Ha].
intros [|[]]; reflexivity || lia.
* fold sat in Hk; cbn in Hk |- *.
exists k. cbn. split; try tauto.
eapply bound_ext; [apply Hψ| |apply Hk].
intros [|[]]; reflexivity || lia.
+ intros [k Hk].
unshelve refine (let H := H2 _ in _); fold sat in *.
* cbn. exists k. split; [|apply Hk].
eapply bound_ext; [apply Hψ| |apply Hk].
intros [|[]]; reflexivity || lia.
* apply sat_comp in H.
eapply bound_ext; [eauto| |apply H].
intros [|[]]; reflexivity || lia.
Unshelve.
{ eapply bounded_subst. 1: apply Hψ.
intros [|[]]; try now intros. }
{ eapply @bounded_subst with (n:=3).
- eapply subst_bound; eauto.
intros [|[]]; cbn; try lia; intros _; constructor; lia.
- intros [|[|[]]]; now intros ?. }
{ unfold unary. solve_bounds.
2, 3: eapply bounded_up; try apply Hψ; lia.
all: eapply subst_bound; eauto.
all: intros [|[]]; cbn; try lia; intros _; constructor; lia. }
Qed.
End notStd.
End Coding.
End Model.