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

Theorem carddomi2 9984
Description: Two sets have the dominance relationship if their cardinalities have the subset relationship and one is numerable. See also carddom 10568, which uses AC. (Contributed by Mario Carneiro, 11-Jan-2013.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
carddomi2 ((𝐴 ∈ dom card ∧ 𝐵𝑉) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴𝐵))

Proof of Theorem carddomi2
StepHypRef Expression
1 cardnueq0 9978 . . . . . 6 (𝐴 ∈ dom card → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
21adantr 480 . . . . 5 ((𝐴 ∈ dom card ∧ 𝐵𝑉) → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
32biimpa 476 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ (card‘𝐴) = ∅) → 𝐴 = ∅)
4 0domg 9114 . . . . 5 (𝐵𝑉 → ∅ ≼ 𝐵)
54ad2antlr 727 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ (card‘𝐴) = ∅) → ∅ ≼ 𝐵)
63, 5eqbrtrd 5141 . . 3 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ (card‘𝐴) = ∅) → 𝐴𝐵)
76a1d 25 . 2 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ (card‘𝐴) = ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴𝐵))
8 fvex 6889 . . . . 5 (card‘𝐵) ∈ V
9 simprr 772 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ⊆ (card‘𝐵))
10 ssdomg 9014 . . . . 5 ((card‘𝐵) ∈ V → ((card‘𝐴) ⊆ (card‘𝐵) → (card‘𝐴) ≼ (card‘𝐵)))
118, 9, 10mpsyl 68 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≼ (card‘𝐵))
12 cardid2 9967 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
1312ad2antrr 726 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≈ 𝐴)
14 simprl 770 . . . . . . 7 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≠ ∅)
15 ssn0 4379 . . . . . . 7 (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → (card‘𝐵) ≠ ∅)
169, 14, 15syl2anc 584 . . . . . 6 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≠ ∅)
17 ndmfv 6911 . . . . . . 7 𝐵 ∈ dom card → (card‘𝐵) = ∅)
1817necon1ai 2959 . . . . . 6 ((card‘𝐵) ≠ ∅ → 𝐵 ∈ dom card)
19 cardid2 9967 . . . . . 6 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
2016, 18, 193syl 18 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≈ 𝐵)
21 domen1 9133 . . . . . 6 ((card‘𝐴) ≈ 𝐴 → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ (card‘𝐵)))
22 domen2 9134 . . . . . 6 ((card‘𝐵) ≈ 𝐵 → (𝐴 ≼ (card‘𝐵) ↔ 𝐴𝐵))
2321, 22sylan9bb 509 . . . . 5 (((card‘𝐴) ≈ 𝐴 ∧ (card‘𝐵) ≈ 𝐵) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴𝐵))
2413, 20, 23syl2anc 584 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴𝐵))
2511, 24mpbid 232 . . 3 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → 𝐴𝐵)
2625expr 456 . 2 (((𝐴 ∈ dom card ∧ 𝐵𝑉) ∧ (card‘𝐴) ≠ ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴𝐵))
277, 26pm2.61dane 3019 1 ((𝐴 ∈ dom card ∧ 𝐵𝑉) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1540  wcel 2108  wne 2932  Vcvv 3459  wss 3926  c0 4308   class class class wbr 5119  dom cdm 5654  cfv 6531  cen 8956  cdom 8957  cardccrd 9949
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 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-pss 3946  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-int 4923  df-br 5120  df-opab 5182  df-mpt 5202  df-tr 5230  df-id 5548  df-eprel 5553  df-po 5561  df-so 5562  df-fr 5606  df-we 5608  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-ord 6355  df-on 6356  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-er 8719  df-en 8960  df-dom 8961  df-card 9953
This theorem is referenced by:  carddom2  9991
  Copyright terms: Public domain W3C validator