Users' Mathboxes Mathbox for Alan Sare < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onfrALT Structured version   Visualization version   GIF version

Theorem onfrALT 45291
Description: The membership relation is foundational on the class of ordinal numbers. onfrALT 45291 is an alternate proof of onfr 6404. onfrALTVD 45632 is the Virtual Deduction proof from which onfrALT 45291 is derived. The Virtual Deduction proof mirrors the working proof of onfr 6404 which is the main part of the proof of Theorem 7.12 of the first edition of TakeutiZaring. The proof of the corresponding Proposition 7.12 of [TakeutiZaring] p. 38 (second edition) does not contain the working proof equivalent of onfrALTVD 45632. This theorem does not rely on the Axiom of Regularity. (Contributed by Alan Sare, 22-Jul-2012.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
onfrALT E Fr On

Proof of Theorem onfrALT
Dummy variables 𝑥 𝑎 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfepfr 5647 . 2 ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
2 simpr 490 . . 3 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅)
3 n0 4307 . . . 4 (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎)
4 onfrALTlem1 45290 . . . . . . 7 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥𝑎 ∧ (𝑎𝑥) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
54expd 421 . . . . . 6 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥𝑎 → ((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
6 onfrALTlem2 45288 . . . . . . 7 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥𝑎 ∧ ¬ (𝑎𝑥) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
76expd 421 . . . . . 6 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥𝑎 → (¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
8 pm2.61 194 . . . . . 6 (((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ((¬ (𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
95, 7, 8syl6c 71 . . . . 5 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
109exlimdv 1966 . . . 4 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (∃𝑥 𝑥𝑎 → ∃𝑦𝑎 (𝑎𝑦) = ∅))
113, 10biimtrid 245 . . 3 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑎 ≠ ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅))
122, 11mpd 16 . 2 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅)
131, 12mpgbir 1832 1 E Fr On
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wa 401   = wceq 1570  wex 1812  wne 2960  wrex 3091  cin 3905  wss 3906  c0 4286   E cep 5562   Fr wfr 5613  Oncon0 6364
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-13 2406  ax-ext 2737  ax-sep 5259  ax-pr 5406
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-tr 5221  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-ord 6367  df-on 6368
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator