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

Theorem onsdom 9425
Description: Any well-orderable set is strictly dominated by an ordinal number. (Contributed by Jeff Hankins, 22-Oct-2009.) (Proof shortened by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
onsdom (𝐴 ∈ dom card → ∃𝑥 ∈ On 𝐴𝑥)
Distinct variable group:   𝑥,𝐴

Proof of Theorem onsdom
StepHypRef Expression
1 harcl 9025 . 2 (har‘𝐴) ∈ On
2 harsdom 9424 . 2 (𝐴 ∈ dom card → 𝐴 ≺ (har‘𝐴))
3 breq2 5070 . . 3 (𝑥 = (har‘𝐴) → (𝐴𝑥𝐴 ≺ (har‘𝐴)))
43rspcev 3623 . 2 (((har‘𝐴) ∈ On ∧ 𝐴 ≺ (har‘𝐴)) → ∃𝑥 ∈ On 𝐴𝑥)
51, 2, 4sylancr 589 1 (𝐴 ∈ dom card → ∃𝑥 ∈ On 𝐴𝑥)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wcel 2114  wrex 3139   class class class wbr 5066  dom cdm 5555  Oncon0 6191  cfv 6355  csdm 8508  harchar 9020  cardccrd 9364
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-wrecs 7947  df-recs 8008  df-er 8289  df-en 8510  df-dom 8511  df-sdom 8512  df-oi 8974  df-har 9022  df-card 9368
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator