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

Theorem carddom2 10017
Description: Two numerable sets have the dominance relationship iff their cardinalities have the subset relationship. See also carddom 10594, which uses AC. (Contributed by Mario Carneiro, 11-Jan-2013.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
carddom2 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴𝐵))

Proof of Theorem carddom2
StepHypRef Expression
1 carddomi2 10010 . 2 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴𝐵))
2 brdom2 9022 . . 3 (𝐴𝐵 ↔ (𝐴𝐵𝐴𝐵))
3 cardon 9984 . . . . . . . 8 (card‘𝐴) ∈ On
43onelssi 6499 . . . . . . 7 ((card‘𝐵) ∈ (card‘𝐴) → (card‘𝐵) ⊆ (card‘𝐴))
5 carddomi2 10010 . . . . . . . 8 ((𝐵 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) → 𝐵𝐴))
65ancoms 458 . . . . . . 7 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ⊆ (card‘𝐴) → 𝐵𝐴))
7 domnsym 9139 . . . . . . 7 (𝐵𝐴 → ¬ 𝐴𝐵)
84, 6, 7syl56 36 . . . . . 6 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ∈ (card‘𝐴) → ¬ 𝐴𝐵))
98con2d 134 . . . . 5 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴𝐵 → ¬ (card‘𝐵) ∈ (card‘𝐴)))
10 cardon 9984 . . . . . 6 (card‘𝐵) ∈ On
11 ontri1 6418 . . . . . 6 (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)))
123, 10, 11mp2an 692 . . . . 5 ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))
139, 12imbitrrdi 252 . . . 4 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴𝐵 → (card‘𝐴) ⊆ (card‘𝐵)))
14 carden2b 10007 . . . . . 6 (𝐴𝐵 → (card‘𝐴) = (card‘𝐵))
15 eqimss 4042 . . . . . 6 ((card‘𝐴) = (card‘𝐵) → (card‘𝐴) ⊆ (card‘𝐵))
1614, 15syl 17 . . . . 5 (𝐴𝐵 → (card‘𝐴) ⊆ (card‘𝐵))
1716a1i 11 . . . 4 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴𝐵 → (card‘𝐴) ⊆ (card‘𝐵)))
1813, 17jaod 860 . . 3 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((𝐴𝐵𝐴𝐵) → (card‘𝐴) ⊆ (card‘𝐵)))
192, 18biimtrid 242 . 2 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴𝐵 → (card‘𝐴) ⊆ (card‘𝐵)))
201, 19impbid 212 1 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wo 848   = wceq 1540  wcel 2108  wss 3951   class class class wbr 5143  dom cdm 5685  Oncon0 6384  cfv 6561  cen 8982  cdom 8983  csdm 8984  cardccrd 9975
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-int 4947  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-ord 6387  df-on 6388  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-er 8745  df-en 8986  df-dom 8987  df-sdom 8988  df-card 9979
This theorem is referenced by:  carduni  10021  carden2  10027  cardsdom2  10028  domtri2  10029  infxpidm2  10057  cardaleph  10129  infenaleph  10131  alephinit  10135  ficardun2  10242  ackbij2  10282  cfflb  10299  fin1a2lem9  10448  carddom  10594  pwfseqlem5  10703  hashdom  14418  minregex2  43548
  Copyright terms: Public domain W3C validator