MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  onfr Structured version   Visualization version   GIF version

Theorem onfr 5722
Description: The ordinal class is well-founded. This lemma is needed for ordon 6929 in order to eliminate the need for the Axiom of Regularity. (Contributed by NM, 17-May-1994.)
Assertion
Ref Expression
onfr E Fr On

Proof of Theorem onfr
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 dfepfr 5059 . 2 ( E Fr On ↔ ∀𝑥((𝑥 ⊆ On ∧ 𝑥 ≠ ∅) → ∃𝑧𝑥 (𝑥𝑧) = ∅))
2 n0 3907 . . . 4 (𝑥 ≠ ∅ ↔ ∃𝑦 𝑦𝑥)
3 ineq2 3786 . . . . . . . . . 10 (𝑧 = 𝑦 → (𝑥𝑧) = (𝑥𝑦))
43eqeq1d 2623 . . . . . . . . 9 (𝑧 = 𝑦 → ((𝑥𝑧) = ∅ ↔ (𝑥𝑦) = ∅))
54rspcev 3295 . . . . . . . 8 ((𝑦𝑥 ∧ (𝑥𝑦) = ∅) → ∃𝑧𝑥 (𝑥𝑧) = ∅)
65adantll 749 . . . . . . 7 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ (𝑥𝑦) = ∅) → ∃𝑧𝑥 (𝑥𝑧) = ∅)
7 inss1 3811 . . . . . . . 8 (𝑥𝑦) ⊆ 𝑥
8 ssel2 3578 . . . . . . . . . . 11 ((𝑥 ⊆ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
9 eloni 5692 . . . . . . . . . . 11 (𝑦 ∈ On → Ord 𝑦)
10 ordfr 5697 . . . . . . . . . . 11 (Ord 𝑦 → E Fr 𝑦)
118, 9, 103syl 18 . . . . . . . . . 10 ((𝑥 ⊆ On ∧ 𝑦𝑥) → E Fr 𝑦)
12 inss2 3812 . . . . . . . . . . 11 (𝑥𝑦) ⊆ 𝑦
13 vex 3189 . . . . . . . . . . . . 13 𝑥 ∈ V
1413inex1 4759 . . . . . . . . . . . 12 (𝑥𝑦) ∈ V
1514epfrc 5060 . . . . . . . . . . 11 (( E Fr 𝑦 ∧ (𝑥𝑦) ⊆ 𝑦 ∧ (𝑥𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥𝑦)((𝑥𝑦) ∩ 𝑧) = ∅)
1612, 15mp3an2 1409 . . . . . . . . . 10 (( E Fr 𝑦 ∧ (𝑥𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥𝑦)((𝑥𝑦) ∩ 𝑧) = ∅)
1711, 16sylan 488 . . . . . . . . 9 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ (𝑥𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥𝑦)((𝑥𝑦) ∩ 𝑧) = ∅)
18 inass 3801 . . . . . . . . . . . . 13 ((𝑥𝑦) ∩ 𝑧) = (𝑥 ∩ (𝑦𝑧))
198, 9syl 17 . . . . . . . . . . . . . . . 16 ((𝑥 ⊆ On ∧ 𝑦𝑥) → Ord 𝑦)
20 elinel2 3778 . . . . . . . . . . . . . . . 16 (𝑧 ∈ (𝑥𝑦) → 𝑧𝑦)
21 ordelss 5698 . . . . . . . . . . . . . . . 16 ((Ord 𝑦𝑧𝑦) → 𝑧𝑦)
2219, 20, 21syl2an 494 . . . . . . . . . . . . . . 15 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ 𝑧 ∈ (𝑥𝑦)) → 𝑧𝑦)
23 sseqin2 3795 . . . . . . . . . . . . . . 15 (𝑧𝑦 ↔ (𝑦𝑧) = 𝑧)
2422, 23sylib 208 . . . . . . . . . . . . . 14 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ 𝑧 ∈ (𝑥𝑦)) → (𝑦𝑧) = 𝑧)
2524ineq2d 3792 . . . . . . . . . . . . 13 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ 𝑧 ∈ (𝑥𝑦)) → (𝑥 ∩ (𝑦𝑧)) = (𝑥𝑧))
2618, 25syl5eq 2667 . . . . . . . . . . . 12 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ 𝑧 ∈ (𝑥𝑦)) → ((𝑥𝑦) ∩ 𝑧) = (𝑥𝑧))
2726eqeq1d 2623 . . . . . . . . . . 11 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ 𝑧 ∈ (𝑥𝑦)) → (((𝑥𝑦) ∩ 𝑧) = ∅ ↔ (𝑥𝑧) = ∅))
2827rexbidva 3042 . . . . . . . . . 10 ((𝑥 ⊆ On ∧ 𝑦𝑥) → (∃𝑧 ∈ (𝑥𝑦)((𝑥𝑦) ∩ 𝑧) = ∅ ↔ ∃𝑧 ∈ (𝑥𝑦)(𝑥𝑧) = ∅))
2928adantr 481 . . . . . . . . 9 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ (𝑥𝑦) ≠ ∅) → (∃𝑧 ∈ (𝑥𝑦)((𝑥𝑦) ∩ 𝑧) = ∅ ↔ ∃𝑧 ∈ (𝑥𝑦)(𝑥𝑧) = ∅))
3017, 29mpbid 222 . . . . . . . 8 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ (𝑥𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥𝑦)(𝑥𝑧) = ∅)
31 ssrexv 3646 . . . . . . . 8 ((𝑥𝑦) ⊆ 𝑥 → (∃𝑧 ∈ (𝑥𝑦)(𝑥𝑧) = ∅ → ∃𝑧𝑥 (𝑥𝑧) = ∅))
327, 30, 31mpsyl 68 . . . . . . 7 (((𝑥 ⊆ On ∧ 𝑦𝑥) ∧ (𝑥𝑦) ≠ ∅) → ∃𝑧𝑥 (𝑥𝑧) = ∅)
336, 32pm2.61dane 2877 . . . . . 6 ((𝑥 ⊆ On ∧ 𝑦𝑥) → ∃𝑧𝑥 (𝑥𝑧) = ∅)
3433ex 450 . . . . 5 (𝑥 ⊆ On → (𝑦𝑥 → ∃𝑧𝑥 (𝑥𝑧) = ∅))
3534exlimdv 1858 . . . 4 (𝑥 ⊆ On → (∃𝑦 𝑦𝑥 → ∃𝑧𝑥 (𝑥𝑧) = ∅))
362, 35syl5bi 232 . . 3 (𝑥 ⊆ On → (𝑥 ≠ ∅ → ∃𝑧𝑥 (𝑥𝑧) = ∅))
3736imp 445 . 2 ((𝑥 ⊆ On ∧ 𝑥 ≠ ∅) → ∃𝑧𝑥 (𝑥𝑧) = ∅)
381, 37mpgbir 1723 1 E Fr On
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wex 1701  wcel 1987  wne 2790  wrex 2908  cin 3554  wss 3555  c0 3891   E cep 4983   Fr wfr 5030  Ord word 5681  Oncon0 5682
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4741  ax-nul 4749  ax-pr 4867
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-dif 3558  df-un 3560  df-in 3562  df-ss 3569  df-nul 3892  df-if 4059  df-sn 4149  df-pr 4151  df-op 4155  df-uni 4403  df-br 4614  df-opab 4674  df-tr 4713  df-eprel 4985  df-po 4995  df-so 4996  df-fr 5033  df-we 5035  df-ord 5685  df-on 5686
This theorem is referenced by:  ordon  6929
  Copyright terms: Public domain W3C validator