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

Theorem carddomi2 10088
Description: Two sets have the dominance relationship if their cardinalities have the subset relationship and one is numerable. See also carddom 10677, 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 10082 . . . . . 6 (𝐴 ∈ dom card → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
21adantr 486 . . . . 5 ((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
32biimpa 482 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → 𝐴 = ∅)
4 0domg 9161 . . . . 5 (𝐵 ∈ 𝑉 → ∅ ≼ 𝐵)
54ad2antlr 740 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → ∅ ≼ 𝐵)
63, 5eqbrtrd 5133 . . 3 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → 𝐴 ≼ 𝐵)
76a1d 26 . 2 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))
8 fvex 6929 . . . . 5 (card‘𝐵) ∈ V
9 simprr 785 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ⊆ (card‘𝐵))
10 ssdomg 9065 . . . . 5 ((card‘𝐵) ∈ V → ((card‘𝐴) ⊆ (card‘𝐵) → (card‘𝐴) ≼ (card‘𝐵)))
118, 9, 10mpsyl 69 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≼ (card‘𝐵))
12 cardid2 10071 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
1312ad2antrr 739 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≈ 𝐴)
14 simprl 783 . . . . . . 7 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≠ ∅)
15 ssn0 4358 . . . . . . 7 (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → (card‘𝐵) ≠ ∅)
169, 14, 15syl2anc 596 . . . . . 6 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≠ ∅)
17 ndmfv 6948 . . . . . . 7 (¬ 𝐵 ∈ dom card → (card‘𝐵) = ∅)
1817necon1ai 2986 . . . . . 6 ((card‘𝐵) ≠ ∅ → 𝐵 ∈ dom card)
19 cardid2 10071 . . . . . 6 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
2016, 18, 193syl 19 . . . . 5 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≈ 𝐵)
21 domen1 9176 . . . . . 6 ((card‘𝐴) ≈ 𝐴 → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ (card‘𝐵)))
22 domen2 9177 . . . . . 6 ((card‘𝐵) ≈ 𝐵 → (𝐴 ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
2321, 22sylan9bb 519 . . . . 5 (((card‘𝐴) ≈ 𝐴 ∧ (card‘𝐵) ≈ 𝐵) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
2413, 20, 23syl2anc 596 . . . 4 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
2511, 24mpbid 235 . . 3 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → 𝐴 ≼ 𝐵)
2625expr 462 . 2 (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) ≠ ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))
277, 26pm2.61dane 3046 1 ((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  Vcvv 3454   ⊆ wss 3900  ∅c0 4281   class class class wbr 5108  dom cdm 5658  ‘cfv 6566   ≈ cen 9008   ≼ cdom 9009  cardccrd 10053
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-er 8755  df-en 9012  df-dom 9013  df-card 10057
This theorem is used by:  carddom2  10095
  Copyright terms: Public domain W3C validator