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 45372
Description: The membership relation is foundational on the class of ordinal numbers. onfrALT 45372 is an alternate proof of onfr 6397. onfrALTVD 45713 is the Virtual Deduction proof from which onfrALT 45372 is derived. The Virtual Deduction proof mirrors the working proof of onfr 6397 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 45713. 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 5639 . 2 ( E Fr On ↔ ∀𝑎((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
2 simpr 490 . . 3 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → 𝑎 ≠ ∅)
3 n0 4300 . . . 4 (𝑎 ≠ ∅ ↔ ∃𝑥 𝑥𝑎)
4 onfrALTlem1 45371 . . . . . . 7 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → ((𝑥𝑎 ∧ (𝑎𝑥) = ∅) → ∃𝑦𝑎 (𝑎𝑦) = ∅))
54expd 421 . . . . . 6 ((𝑎 ⊆ On ∧ 𝑎 ≠ ∅) → (𝑥𝑎 → ((𝑎𝑥) = ∅ → ∃𝑦𝑎 (𝑎𝑦) = ∅)))
6 onfrALTlem2 45369 . . . . . . 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 2955  wrex 3086  cin 3898  wss 3899  c0 4279   E cep 5554   Fr wfr 5605  Oncon0 6357
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2401  ax-ext 2732  ax-sep 5251  ax-pr 5398
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 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-ord 6360  df-on 6361
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator