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

Theorem cardsdomel 9982
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 9961 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
21ensymd 9014 . . . . . 6 (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵))
3 sdomentr 9112 . . . . . 6 ((𝐴𝐵𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵))
42, 3sylan2 605 . . . . 5 ((𝐴𝐵𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵))
5 ssdomg 9009 . . . . . . . 8 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴))
6 cardon 9952 . . . . . . . . 9 (card‘𝐵) ∈ On
7 domtriord 9124 . . . . . . . . 9 (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵)))
86, 7mpan 703 . . . . . . . 8 (𝐴 ∈ On → ((card‘𝐵) ≼ 𝐴 ↔ ¬ 𝐴 ≺ (card‘𝐵)))
95, 8sylibd 242 . . . . . . 7 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → ¬ 𝐴 ≺ (card‘𝐵)))
109con2d 135 . . . . . 6 (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → ¬ (card‘𝐵) ⊆ 𝐴))
11 ontri1 6396 . . . . . . . 8 (((card‘𝐵) ∈ On ∧ 𝐴 ∈ On) → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
126, 11mpan 703 . . . . . . 7 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 ↔ ¬ 𝐴 ∈ (card‘𝐵)))
1312con2bid 357 . . . . . 6 (𝐴 ∈ On → (𝐴 ∈ (card‘𝐵) ↔ ¬ (card‘𝐵) ⊆ 𝐴))
1410, 13sylibrd 262 . . . . 5 (𝐴 ∈ On → (𝐴 ≺ (card‘𝐵) → 𝐴 ∈ (card‘𝐵)))
154, 14syl5 35 . . . 4 (𝐴 ∈ On → ((𝐴𝐵𝐵 ∈ dom card) → 𝐴 ∈ (card‘𝐵)))
1615expcomd 422 . . 3 (𝐴 ∈ On → (𝐵 ∈ dom card → (𝐴𝐵𝐴 ∈ (card‘𝐵))))
1716imp 412 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴𝐵𝐴 ∈ (card‘𝐵)))
18 cardsdomelir 9981 . 2 (𝐴 ∈ (card‘𝐵) → 𝐴𝐵)
1917, 18impbid1 228 1 ((𝐴 ∈ On ∧ 𝐵 ∈ dom card) → (𝐴𝐵𝐴 ∈ (card‘𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  wcel 2145  wss 3902   class class class wbr 5107  dom cdm 5659  Oncon0 6361  cfv 6537  cen 8952  cdom 8953  csdm 8954  cardccrd 9943
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-card 9947
This theorem is used by:  iscard  9983  cardval2  9999  infxpenlem  10019  alephnbtwn  10077  alephnbtwn2  10078  alephord2  10082  alephsdom  10092  pwsdompw  10208  inaprc  10848
  Copyright terms: Public domain W3C validator