Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfon2 Structured version   Visualization version   GIF version

Theorem dfon2 33674
Description: On consists of all sets that contain all its transitive proper subsets. This definition comes from J. R. Isbell, "A Definition of Ordinal Numbers", American Mathematical Monthly, vol 67 (1960), pp. 51-52. (Contributed by Scott Fenton, 20-Feb-2011.)
Assertion
Ref Expression
dfon2 On = {𝑥 ∣ ∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥)}
Distinct variable group:   𝑥,𝑦

Proof of Theorem dfon2
Dummy variables 𝑧 𝑤 𝑡 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-on 6255 . 2 On = {𝑥 ∣ Ord 𝑥}
2 tz7.7 6277 . . . . . . . . 9 ((Ord 𝑥 ∧ Tr 𝑦) → (𝑦𝑥 ↔ (𝑦𝑥𝑦𝑥)))
3 df-pss 3902 . . . . . . . . 9 (𝑦𝑥 ↔ (𝑦𝑥𝑦𝑥))
42, 3bitr4di 288 . . . . . . . 8 ((Ord 𝑥 ∧ Tr 𝑦) → (𝑦𝑥𝑦𝑥))
54exbiri 807 . . . . . . 7 (Ord 𝑥 → (Tr 𝑦 → (𝑦𝑥𝑦𝑥)))
65com23 86 . . . . . 6 (Ord 𝑥 → (𝑦𝑥 → (Tr 𝑦𝑦𝑥)))
76impd 410 . . . . 5 (Ord 𝑥 → ((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥))
87alrimiv 1931 . . . 4 (Ord 𝑥 → ∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥))
9 vex 3426 . . . . . . 7 𝑥 ∈ V
10 dfon2lem3 33667 . . . . . . 7 (𝑥 ∈ V → (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → (Tr 𝑥 ∧ ∀𝑧𝑥 ¬ 𝑧𝑧)))
119, 10ax-mp 5 . . . . . 6 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → (Tr 𝑥 ∧ ∀𝑧𝑥 ¬ 𝑧𝑧))
1211simpld 494 . . . . 5 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → Tr 𝑥)
139dfon2lem7 33671 . . . . . . . 8 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → (𝑡𝑥 → ∀𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡)))
1413ralrimiv 3106 . . . . . . 7 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → ∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡))
15 dfon2lem9 33673 . . . . . . . 8 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → E Fr 𝑥)
16 psseq2 4019 . . . . . . . . . . . . . . . 16 (𝑡 = 𝑧 → (𝑢𝑡𝑢𝑧))
1716anbi1d 629 . . . . . . . . . . . . . . 15 (𝑡 = 𝑧 → ((𝑢𝑡 ∧ Tr 𝑢) ↔ (𝑢𝑧 ∧ Tr 𝑢)))
18 elequ2 2123 . . . . . . . . . . . . . . 15 (𝑡 = 𝑧 → (𝑢𝑡𝑢𝑧))
1917, 18imbi12d 344 . . . . . . . . . . . . . 14 (𝑡 = 𝑧 → (((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ((𝑢𝑧 ∧ Tr 𝑢) → 𝑢𝑧)))
2019albidv 1924 . . . . . . . . . . . . 13 (𝑡 = 𝑧 → (∀𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ∀𝑢((𝑢𝑧 ∧ Tr 𝑢) → 𝑢𝑧)))
21 psseq1 4018 . . . . . . . . . . . . . . . 16 (𝑢 = 𝑣 → (𝑢𝑧𝑣𝑧))
22 treq 5193 . . . . . . . . . . . . . . . 16 (𝑢 = 𝑣 → (Tr 𝑢 ↔ Tr 𝑣))
2321, 22anbi12d 630 . . . . . . . . . . . . . . 15 (𝑢 = 𝑣 → ((𝑢𝑧 ∧ Tr 𝑢) ↔ (𝑣𝑧 ∧ Tr 𝑣)))
24 elequ1 2115 . . . . . . . . . . . . . . 15 (𝑢 = 𝑣 → (𝑢𝑧𝑣𝑧))
2523, 24imbi12d 344 . . . . . . . . . . . . . 14 (𝑢 = 𝑣 → (((𝑢𝑧 ∧ Tr 𝑢) → 𝑢𝑧) ↔ ((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧)))
2625cbvalvw 2040 . . . . . . . . . . . . 13 (∀𝑢((𝑢𝑧 ∧ Tr 𝑢) → 𝑢𝑧) ↔ ∀𝑣((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧))
2720, 26bitrdi 286 . . . . . . . . . . . 12 (𝑡 = 𝑧 → (∀𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ∀𝑣((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧)))
2827rspccv 3549 . . . . . . . . . . 11 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → (𝑧𝑥 → ∀𝑣((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧)))
29 psseq2 4019 . . . . . . . . . . . . . . . 16 (𝑡 = 𝑤 → (𝑢𝑡𝑢𝑤))
3029anbi1d 629 . . . . . . . . . . . . . . 15 (𝑡 = 𝑤 → ((𝑢𝑡 ∧ Tr 𝑢) ↔ (𝑢𝑤 ∧ Tr 𝑢)))
31 elequ2 2123 . . . . . . . . . . . . . . 15 (𝑡 = 𝑤 → (𝑢𝑡𝑢𝑤))
3230, 31imbi12d 344 . . . . . . . . . . . . . 14 (𝑡 = 𝑤 → (((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ((𝑢𝑤 ∧ Tr 𝑢) → 𝑢𝑤)))
3332albidv 1924 . . . . . . . . . . . . 13 (𝑡 = 𝑤 → (∀𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ∀𝑢((𝑢𝑤 ∧ Tr 𝑢) → 𝑢𝑤)))
34 psseq1 4018 . . . . . . . . . . . . . . . 16 (𝑢 = 𝑦 → (𝑢𝑤𝑦𝑤))
35 treq 5193 . . . . . . . . . . . . . . . 16 (𝑢 = 𝑦 → (Tr 𝑢 ↔ Tr 𝑦))
3634, 35anbi12d 630 . . . . . . . . . . . . . . 15 (𝑢 = 𝑦 → ((𝑢𝑤 ∧ Tr 𝑢) ↔ (𝑦𝑤 ∧ Tr 𝑦)))
37 elequ1 2115 . . . . . . . . . . . . . . 15 (𝑢 = 𝑦 → (𝑢𝑤𝑦𝑤))
3836, 37imbi12d 344 . . . . . . . . . . . . . 14 (𝑢 = 𝑦 → (((𝑢𝑤 ∧ Tr 𝑢) → 𝑢𝑤) ↔ ((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤)))
3938cbvalvw 2040 . . . . . . . . . . . . 13 (∀𝑢((𝑢𝑤 ∧ Tr 𝑢) → 𝑢𝑤) ↔ ∀𝑦((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤))
4033, 39bitrdi 286 . . . . . . . . . . . 12 (𝑡 = 𝑤 → (∀𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) ↔ ∀𝑦((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤)))
4140rspccv 3549 . . . . . . . . . . 11 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → (𝑤𝑥 → ∀𝑦((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤)))
4228, 41anim12d 608 . . . . . . . . . 10 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → ((𝑧𝑥𝑤𝑥) → (∀𝑣((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧) ∧ ∀𝑦((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤))))
43 vex 3426 . . . . . . . . . . 11 𝑧 ∈ V
44 vex 3426 . . . . . . . . . . 11 𝑤 ∈ V
4543, 44dfon2lem5 33669 . . . . . . . . . 10 ((∀𝑣((𝑣𝑧 ∧ Tr 𝑣) → 𝑣𝑧) ∧ ∀𝑦((𝑦𝑤 ∧ Tr 𝑦) → 𝑦𝑤)) → (𝑧𝑤𝑧 = 𝑤𝑤𝑧))
4642, 45syl6 35 . . . . . . . . 9 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → ((𝑧𝑥𝑤𝑥) → (𝑧𝑤𝑧 = 𝑤𝑤𝑧)))
4746ralrimivv 3113 . . . . . . . 8 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧))
4815, 47jca 511 . . . . . . 7 (∀𝑡𝑥𝑢((𝑢𝑡 ∧ Tr 𝑢) → 𝑢𝑡) → ( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧)))
4914, 48syl 17 . . . . . 6 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → ( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧)))
50 dfwe2 7602 . . . . . . 7 ( E We 𝑥 ↔ ( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧 E 𝑤𝑧 = 𝑤𝑤 E 𝑧)))
51 epel 5489 . . . . . . . . . 10 (𝑧 E 𝑤𝑧𝑤)
52 biid 260 . . . . . . . . . 10 (𝑧 = 𝑤𝑧 = 𝑤)
53 epel 5489 . . . . . . . . . 10 (𝑤 E 𝑧𝑤𝑧)
5451, 52, 533orbi123i 1154 . . . . . . . . 9 ((𝑧 E 𝑤𝑧 = 𝑤𝑤 E 𝑧) ↔ (𝑧𝑤𝑧 = 𝑤𝑤𝑧))
55542ralbii 3091 . . . . . . . 8 (∀𝑧𝑥𝑤𝑥 (𝑧 E 𝑤𝑧 = 𝑤𝑤 E 𝑧) ↔ ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧))
5655anbi2i 622 . . . . . . 7 (( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧 E 𝑤𝑧 = 𝑤𝑤 E 𝑧)) ↔ ( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧)))
5750, 56bitri 274 . . . . . 6 ( E We 𝑥 ↔ ( E Fr 𝑥 ∧ ∀𝑧𝑥𝑤𝑥 (𝑧𝑤𝑧 = 𝑤𝑤𝑧)))
5849, 57sylibr 233 . . . . 5 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → E We 𝑥)
59 df-ord 6254 . . . . 5 (Ord 𝑥 ↔ (Tr 𝑥 ∧ E We 𝑥))
6012, 58, 59sylanbrc 582 . . . 4 (∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥) → Ord 𝑥)
618, 60impbii 208 . . 3 (Ord 𝑥 ↔ ∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥))
6261abbii 2809 . 2 {𝑥 ∣ Ord 𝑥} = {𝑥 ∣ ∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥)}
631, 62eqtri 2766 1 On = {𝑥 ∣ ∀𝑦((𝑦𝑥 ∧ Tr 𝑦) → 𝑦𝑥)}
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395  w3o 1084  wal 1537   = wceq 1539  wcel 2108  {cab 2715  wne 2942  wral 3063  Vcvv 3422  wss 3883  wpss 3884   class class class wbr 5070  Tr wtr 5187   E cep 5485   Fr wfr 5532   We wwe 5534  Ord word 6250  Oncon0 6251
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-tr 5188  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-ord 6254  df-on 6255  df-suc 6257
This theorem is referenced by:  dfon3  34121
  Copyright terms: Public domain W3C validator