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

Theorem cardsdomel 9732
Description: A cardinal strictly dominates its members. Equivalent to Proposition 10.37 of [TakeutiZaring] p. 93. (Contributed by Mario Carneiro, 15-Jan-2013.) (Revised by Mario Carneiro, 4-Jun-2015.)
Assertion
Ref Expression
cardsdomel ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴𝐵𝐴 ∈ (card‘𝐵)))

Proof of Theorem cardsdomel
StepHypRef Expression
1 cardid2 9711 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
21ensymd 8791 . . . . . 6 (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵))
3 sdomentr 8898 . . . . . 6 ((𝐴𝐵𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵))
42, 3sylan2 593 . . . . 5 ((𝐴𝐵𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵))
5 ssdomg 8786 . . . . . . . 8 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴))
6 cardon 9702 . . . . . . . . 9 (card‘𝐵) ∈ On
7 domtriord 8910 . . . . . . . . 9 (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵)))
86, 7mpan 687 . . . . . . . 8 (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵)))
95, 8sylibd 238 . . . . . . 7 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵)))
109con2d 134 . . . . . 6 (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴))
11 ontri1 6300 . . . . . . . 8 (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
126, 11mpan 687 . . . . . . 7 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
1312con2bid 355 . . . . . 6 (𝐴 ∈ On → (𝐴 ∈ (card‘𝐵) ↔ ¬ (card‘𝐵) ⊆ 𝐴))
1410, 13sylibrd 258 . . . . 5 (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → 𝐴 ∈ (card‘𝐵)))
154, 14syl5 34 . . . 4 (𝐴 ∈ On → ((𝐴𝐵𝐵 ∈ dom card) → 𝐴 ∈ (card‘𝐵)))
1615expcomd 417 . . 3 (𝐴 ∈ On → (𝐵 ∈ dom card → (𝐴𝐵𝐴 ∈ (card‘𝐵))))
1716imp 407 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴𝐵𝐴 ∈ (card‘𝐵)))
18 cardsdomelir 9731 . 2 (𝐴 ∈ (card‘𝐵) → 𝐴𝐵)
1917, 18impbid1 224 1 ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴𝐵𝐴 ∈ (card‘𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wcel 2106  wss 3887   class class class wbr 5074  dom cdm 5589  Oncon0 6266  cfv 6433  cen 8730  cdom 8731  csdm 8732  cardccrd 9693
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-card 9697
This theorem is referenced by:  iscard  9733  cardval2  9749  infxpenlem  9769  alephnbtwn  9827  alephnbtwn2  9828  alephord2  9832  alephsdom  9842  pwsdompw  9960  inaprc  10592
  Copyright terms: Public domain W3C validator