Metamath Proof Explorer


Theorem ex-sategoelel12

Description: Example of a valuation of a simplified satisfaction predicate over a proper pair (of ordinal numbers) as model for a Godel-set of membership using the properties of a successor: ( S2o ) = 1o e. 2o = ( S2o ) . Remark: the indices 1o and 2o are intentionally reversed to distinguish them from elements of the model: ( 2o e.g 1o ) should not be confused with 2o e. 1o , which is false. (Contributed by AV, 19-Nov-2023)

Ref Expression
Hypothesis ex-sategoelel12.s ⊢ S = x ∈ ω ⟼ if x = 2 𝑜 1 𝑜 2 𝑜
Assertion ex-sategoelel12 ⊢ S ∈ 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜

Proof

Step Hyp Ref Expression
1 ex-sategoelel12.s ⊢ S = x ∈ ω ⟼ if x = 2 𝑜 1 𝑜 2 𝑜
2 1oex ⊢ 1 𝑜 ∈ V
3 2 prid1 ⊢ 1 𝑜 ∈ 1 𝑜 2 𝑜
4 2oex ⊢ 2 𝑜 ∈ V
5 4 prid2 ⊢ 2 𝑜 ∈ 1 𝑜 2 𝑜
6 3 5 ifcli ⊢ if x = 2 𝑜 1 𝑜 2 𝑜 ∈ 1 𝑜 2 𝑜
7 6 a1i ⊢ x ∈ ω → if x = 2 𝑜 1 𝑜 2 𝑜 ∈ 1 𝑜 2 𝑜
8 1 7 fmpti ⊢ S : ω ⟶ 1 𝑜 2 𝑜
9 prex ⊢ 1 𝑜 2 𝑜 ∈ V
10 omex ⊢ ω ∈ V
11 9 10 elmap ⊢ S ∈ 1 𝑜 2 𝑜 ω ↔ S : ω ⟶ 1 𝑜 2 𝑜
12 8 11 mpbir ⊢ S ∈ 1 𝑜 2 𝑜 ω
13 2 sucid ⊢ 1 𝑜 ∈ suc ⁡ 1 𝑜
14 df-2o ⊢ 2 𝑜 = suc ⁡ 1 𝑜
15 13 14 eleqtrri ⊢ 1 𝑜 ∈ 2 𝑜
16 2onn ⊢ 2 𝑜 ∈ ω
17 1onn ⊢ 1 𝑜 ∈ ω
18 iftrue ⊢ x = 2 𝑜 → if x = 2 𝑜 1 𝑜 2 𝑜 = 1 𝑜
19 18 1 fvmptg ⊢ 2 𝑜 ∈ ω ∧ 1 𝑜 ∈ ω → S ⁡ 2 𝑜 = 1 𝑜
20 16 17 19 mp2an ⊢ S ⁡ 2 𝑜 = 1 𝑜
21 1one2o ⊢ 1 𝑜 ≠ 2 𝑜
22 21 neii ⊢ ¬ 1 𝑜 = 2 𝑜
23 eqeq1 ⊢ x = 1 𝑜 → x = 2 𝑜 ↔ 1 𝑜 = 2 𝑜
24 22 23 mtbiri ⊢ x = 1 𝑜 → ¬ x = 2 𝑜
25 24 iffalsed ⊢ x = 1 𝑜 → if x = 2 𝑜 1 𝑜 2 𝑜 = 2 𝑜
26 25 1 fvmptg ⊢ 1 𝑜 ∈ ω ∧ 2 𝑜 ∈ ω → S ⁡ 1 𝑜 = 2 𝑜
27 17 16 26 mp2an ⊢ S ⁡ 1 𝑜 = 2 𝑜
28 15 20 27 3eltr4i ⊢ S ⁡ 2 𝑜 ∈ S ⁡ 1 𝑜
29 12 28 pm3.2i ⊢ S ∈ 1 𝑜 2 𝑜 ω ∧ S ⁡ 2 𝑜 ∈ S ⁡ 1 𝑜
30 16 17 pm3.2i ⊢ 2 𝑜 ∈ ω ∧ 1 𝑜 ∈ ω
31 eqid ⊢ 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜 = 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜
32 31 sategoelfvb ⊢ 1 𝑜 2 𝑜 ∈ V ∧ 2 𝑜 ∈ ω ∧ 1 𝑜 ∈ ω → S ∈ 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜 ↔ S ∈ 1 𝑜 2 𝑜 ω ∧ S ⁡ 2 𝑜 ∈ S ⁡ 1 𝑜
33 9 30 32 mp2an ⊢ S ∈ 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜 ↔ S ∈ 1 𝑜 2 𝑜 ω ∧ S ⁡ 2 𝑜 ∈ S ⁡ 1 𝑜
34 29 33 mpbir ⊢ S ∈ 1 𝑜 2 𝑜 Sat ∈ 2 𝑜 ∈ 𝑔 1 𝑜