Users' Mathboxes Mathbox for Thomas van Maaren < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  varprop Structured version   Visualization version   GIF version

Theorem varprop 38912
Description: Variables encoded as natural numbers are sentences of propositional calculus. (Contributed by Thomas van Maaren, 21-Aug-2026.)
Assertion
Ref Expression
varprop (𝑛 ∈ ℕ → (propvar ‘𝑛) ∈ PROP)

Proof of Theorem varprop
Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-prop 38910 . . 3 PROP = setrecs((𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))}))
2 0ex 5266 . . . 4 ∅ ∈ V
32a1i 11 . . 3 (𝑛 ∈ ℕ → ∅ ∈ V)
4 0ss 4352 . . . 4 ∅ ⊆ PROP
54a1i 11 . . 3 (𝑛 ∈ ℕ → ∅ ⊆ PROP)
61, 3, 5setrec1 10008 . 2 (𝑛 ∈ ℕ → ((𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})‘∅) ⊆ PROP)
7 rspe 3256 . . . . . . 7 ((𝑛 ∈ ℕ ∧ 𝑥 = (propvar ‘𝑛)) → ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))
87olcd 888 . . . . . 6 ((𝑛 ∈ ℕ ∧ 𝑥 = (propvar ‘𝑛)) → (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛)))
98ex 418 . . . . 5 (𝑛 ∈ ℕ → (𝑥 = (propvar ‘𝑛) → (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))))
109alrimiv 1964 . . . 4 (𝑛 ∈ ℕ → ∀𝑥(𝑥 = (propvar ‘𝑛) → (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))))
11 fvex 6928 . . . . 5 (propvar ‘𝑛) ∈ V
12 elab6g 3625 . . . . 5 ((propvar ‘𝑛) ∈ V → ((propvar ‘𝑛) ∈ {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))} ↔ ∀𝑥(𝑥 = (propvar ‘𝑛) → (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛)))))
1311, 12ax-mp 5 . . . 4 ((propvar ‘𝑛) ∈ {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))} ↔ ∀𝑥(𝑥 = (propvar ‘𝑛) → (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))))
1410, 13sylibr 237 . . 3 (𝑛 ∈ ℕ → (propvar ‘𝑛) ∈ {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})
15 rexeq 3319 . . . . . . . . 9 (𝑦 = ∅ → (∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧) ↔ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)))
1615orbi2d 929 . . . . . . . 8 (𝑦 = ∅ → ((𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ↔ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧))))
1716rexeqbi1dv 3334 . . . . . . 7 (𝑦 = ∅ → (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ↔ ∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧))))
1817orbi1d 930 . . . . . 6 (𝑦 = ∅ → ((∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛)) ↔ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))))
1918abbidv 2832 . . . . 5 (𝑦 = ∅ → {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))} = {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})
20 eqid 2766 . . . . 5 (𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))}) = (𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})
212dfproplem 38911 . . . . 5 {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))} ∈ V
2219, 20, 21fvmpt 7023 . . . 4 (∅ ∈ V → ((𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})‘∅) = {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})
232, 22ax-mp 5 . . 3 ((𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})‘∅) = {𝑥 ∣ (∃𝑧 ∈ ∅ (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ ∅ 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))}
2414, 23eleqtrrdi 2878 . 2 (𝑛 ∈ ℕ → (propvar ‘𝑛) ∈ ((𝑦 ∈ V ↦ {𝑥 ∣ (∃𝑧 ∈ 𝑦 (𝑥 = (prop¬‘𝑧) ∨ ∃𝑤 ∈ 𝑦 𝑥 = (𝑤prop→𝑧)) ∨ ∃𝑛 ∈ ℕ 𝑥 = (propvar ‘𝑛))})‘∅))
256, 24sseldd 3913 1 (𝑛 ∈ ℕ → (propvar ‘𝑛) ∈ PROP)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861  ∀wal 1570   = wceq 1572   ∈ wcel 2150  {cab 2744  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899  ∅c0 4280   ↦ cmpt 5191  ‘cfv 6565  (class class class)co 7450  ℕcn 12374  propvar cpropvar 38903  prop¬cpropneg 38904  prop→cpropimp 38905  PROPcprop 38909
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-reg 9622  ax-inf2 9678  ax-cnex 11294  ax-1cn 11296  ax-addcl 11298
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-int 4912  df-iun 4957  df-iin 4958  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-ov 7453  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-r1 9804  df-rank 9805  df-scott 9965  df-setrecs 10001  df-nn 12375  df-prop 38910
This theorem is used by:  dfprop1  38915
  Copyright terms: Public domain W3C validator