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

Theorem cardsdomel 10026
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 10005 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
21ensymd 9010 . . . . . 6 (𝐵 ∈ dom card → 𝐵 ≈ (card‘𝐵))
3 sdomentr 9108 . . . . . 6 ((𝐴 ≺ 𝐵 ∧ 𝐵 ≈ (card‘𝐵)) → 𝐴 ≺ (card‘𝐵))
42, 3sylan2 605 . . . . 5 ((𝐴 ≺ 𝐵 ∧ 𝐵 ∈ dom card) → 𝐴 ≺ (card‘𝐵))
5 ssdomg 9005 . . . . . . . 8 (𝐴 ∈ On → ((card‘𝐵) ⊆ 𝐴 → (card‘𝐵) ≼ 𝐴))
6 cardon 9996 . . . . . . . . 9 (card‘𝐵) ∈ On
7 domtriord 9120 . . . . . . . . 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 6386 . . . . . . . 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 10025 . 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 3898   class class class wbr 5102  dom cdm 5647  Oncon0 6351  ‘cfv 6527   ≈ cen 8948   ≼ cdom 8949   ≺ csdm 8950  cardccrd 9987
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 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7734
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 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-card 9991
This theorem is used by:  iscard  10027  cardval2  10043  infxpenlem  10063  alephnbtwn  10121  alephnbtwn2  10122  alephord2  10126  alephsdom  10136  pwsdompw  10252  inaprc  10892
  Copyright terms: Public domain W3C validator