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

Theorem onfr 6427
Description: The ordinal class is well-founded. This proof does not require the axiom of regularity. This lemma is used in ordon 7822 (through epweon 7820) 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 5641 . 2 ( E Fr On ↔ ∀𝑥((𝑥 ⊆ On ∧ 𝑥 ≠ ∅) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅))
2 n0 4302 . . . 4 (𝑥 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝑥)
3 ineq2 4113 . . . . . . . . . 10 (𝑧 = 𝑦 → (𝑥 ∩ 𝑧) = (𝑥 ∩ 𝑦))
43eqeq1d 2768 . . . . . . . . 9 (𝑧 = 𝑦 → ((𝑥 ∩ 𝑧) = ∅ ↔ (𝑥 ∩ 𝑦) = ∅))
54rspcev 3579 . . . . . . . 8 ((𝑦 ∈ 𝑥 ∧ (𝑥 ∩ 𝑦) = ∅) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅)
65adantll 727 . . . . . . 7 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ (𝑥 ∩ 𝑦) = ∅) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅)
7 inss1 4135 . . . . . . . 8 (𝑥 ∩ 𝑦) ⊆ 𝑥
8 ssel2 3907 . . . . . . . . . . 11 ((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ On)
9 eloni 6397 . . . . . . . . . . 11 (𝑦 ∈ On → Ord 𝑦)
10 ordfr 6402 . . . . . . . . . . 11 (Ord 𝑦 → E Fr 𝑦)
118, 9, 103syl 19 . . . . . . . . . 10 ((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) → E Fr 𝑦)
12 inss2 4136 . . . . . . . . . . 11 (𝑥 ∩ 𝑦) ⊆ 𝑦
13 vex 3457 . . . . . . . . . . . . 13 𝑥 ∈ V
1413inex1 5283 . . . . . . . . . . . 12 (𝑥 ∩ 𝑦) ∈ V
1514epfrc 5642 . . . . . . . . . . 11 (( E Fr 𝑦 ∧ (𝑥 ∩ 𝑦) ⊆ 𝑦 ∧ (𝑥 ∩ 𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥 ∩ 𝑦)((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅)
1612, 15mp3an2 1481 . . . . . . . . . 10 (( E Fr 𝑦 ∧ (𝑥 ∩ 𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥 ∩ 𝑦)((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅)
1711, 16sylan 592 . . . . . . . . 9 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ (𝑥 ∩ 𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥 ∩ 𝑦)((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅)
18 inass 4126 . . . . . . . . . . . . 13 ((𝑥 ∩ 𝑦) ∩ 𝑧) = (𝑥 ∩ (𝑦 ∩ 𝑧))
198, 9syl 18 . . . . . . . . . . . . . . . 16 ((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) → Ord 𝑦)
20 elinel2 4101 . . . . . . . . . . . . . . . 16 (𝑧 ∈ (𝑥 ∩ 𝑦) → 𝑧 ∈ 𝑦)
21 ordelss 6403 . . . . . . . . . . . . . . . 16 ((Ord 𝑦 ∧ 𝑧 ∈ 𝑦) → 𝑧 ⊆ 𝑦)
2219, 20, 21syl2an 608 . . . . . . . . . . . . . . 15 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → 𝑧 ⊆ 𝑦)
23 sseqin2 4122 . . . . . . . . . . . . . . 15 (𝑧 ⊆ 𝑦 ↔ (𝑦 ∩ 𝑧) = 𝑧)
2422, 23sylib 221 . . . . . . . . . . . . . 14 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → (𝑦 ∩ 𝑧) = 𝑧)
2524ineq2d 4119 . . . . . . . . . . . . 13 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → (𝑥 ∩ (𝑦 ∩ 𝑧)) = (𝑥 ∩ 𝑧))
2618, 25eqtrid 2813 . . . . . . . . . . . 12 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → ((𝑥 ∩ 𝑦) ∩ 𝑧) = (𝑥 ∩ 𝑧))
2726eqeq1d 2768 . . . . . . . . . . 11 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ 𝑧 ∈ (𝑥 ∩ 𝑦)) → (((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅ ↔ (𝑥 ∩ 𝑧) = ∅))
2827rexbidva 3191 . . . . . . . . . 10 ((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) → (∃𝑧 ∈ (𝑥 ∩ 𝑦)((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅ ↔ ∃𝑧 ∈ (𝑥 ∩ 𝑦)(𝑥 ∩ 𝑧) = ∅))
2928adantr 486 . . . . . . . . 9 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ (𝑥 ∩ 𝑦) ≠ ∅) → (∃𝑧 ∈ (𝑥 ∩ 𝑦)((𝑥 ∩ 𝑦) ∩ 𝑧) = ∅ ↔ ∃𝑧 ∈ (𝑥 ∩ 𝑦)(𝑥 ∩ 𝑧) = ∅))
3017, 29mpbid 235 . . . . . . . 8 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ (𝑥 ∩ 𝑦) ≠ ∅) → ∃𝑧 ∈ (𝑥 ∩ 𝑦)(𝑥 ∩ 𝑧) = ∅)
31 ssrexv 3982 . . . . . . . 8 ((𝑥 ∩ 𝑦) ⊆ 𝑥 → (∃𝑧 ∈ (𝑥 ∩ 𝑦)(𝑥 ∩ 𝑧) = ∅ → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅))
327, 30, 31mpsyl 69 . . . . . . 7 (((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) ∧ (𝑥 ∩ 𝑦) ≠ ∅) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅)
336, 32pm2.61dane 3049 . . . . . 6 ((𝑥 ⊆ On ∧ 𝑦 ∈ 𝑥) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅)
3433ex 418 . . . . 5 (𝑥 ⊆ On → (𝑦 ∈ 𝑥 → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅))
3534exlimdv 1970 . . . 4 (𝑥 ⊆ On → (∃𝑦 𝑦 ∈ 𝑥 → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅))
362, 35biimtrid 245 . . 3 (𝑥 ⊆ On → (𝑥 ≠ ∅ → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅))
3736imp 412 . 2 ((𝑥 ⊆ On ∧ 𝑥 ≠ ∅) → ∃𝑧 ∈ 𝑥 (𝑥 ∩ 𝑧) = ∅)
381, 37mpgbir 1834 1 E Fr On
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572  ∃wex 1814   ∈ wcel 2150   ≠ wne 2962  ∃wrex 3093   ⊆ wss 3899   ∩ cin 4091  ∅c0 4280   E cep 5556   Fr wfr 5607  Ord word 6386  Oncon0 6387
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-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  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-br 5108  df-opab 5173  df-tr 5218  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-ord 6390  df-on 6391
This theorem is used by:  epweon  7820  epweonALT  7821  on2recsfn  8713  on2recsov  8714  on2ind  8715  on3ind  8716  wffr  46275
  Copyright terms: Public domain W3C validator