Theorem carddomi2 10039

Description: Two sets have the dominance relationship if their cardinalities have the subset relationship and one is numerable. See also carddom 10623, 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

Step	Hyp	Ref	Expression
1		cardnueq0 10033	. . . . . 6 ⊢ (𝐴 ∈ dom card → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
2	1	adantr 480	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) → ((card‘𝐴) = ∅ ↔ 𝐴 = ∅))
3	2	biimpa 476	. . . 4 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → 𝐴 = ∅)
4		0domg 9166	. . . . 5 ⊢ (𝐵 ∈ 𝑉 → ∅ ≼ 𝐵)
5	4	ad2antlr 726	. . . 4 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → ∅ ≼ 𝐵)
6	3, 5	eqbrtrd 5188	. . 3 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → 𝐴 ≼ 𝐵)
7	6	a1d 25	. 2 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) = ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))
8		fvex 6933	. . . . 5 ⊢ (card‘𝐵) ∈ V
9		simprr 772	. . . . 5 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ⊆ (card‘𝐵))
10		ssdomg 9060	. . . . 5 ⊢ ((card‘𝐵) ∈ V → ((card‘𝐴) ⊆ (card‘𝐵) → (card‘𝐴) ≼ (card‘𝐵)))
11	8, 9, 10	mpsyl 68	. . . 4 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≼ (card‘𝐵))
12		cardid2 10022	. . . . . 6 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
13	12	ad2antrr 725	. . . . 5 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≈ 𝐴)
14		simprl 770	. . . . . . 7 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐴) ≠ ∅)
15		ssn0 4427	. . . . . . 7 ⊢ (((card‘𝐴) ⊆ (card‘𝐵) ∧ (card‘𝐴) ≠ ∅) → (card‘𝐵) ≠ ∅)
16	9, 14, 15	syl2anc 583	. . . . . 6 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≠ ∅)
17		ndmfv 6955	. . . . . . 7 ⊢ (¬ 𝐵 ∈ dom card → (card‘𝐵) = ∅)
18	17	necon1ai 2974	. . . . . 6 ⊢ ((card‘𝐵) ≠ ∅ → 𝐵 ∈ dom card)
19		cardid2 10022	. . . . . 6 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
20	16, 18, 19	3syl 18	. . . . 5 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → (card‘𝐵) ≈ 𝐵)
21		domen1 9185	. . . . . 6 ⊢ ((card‘𝐴) ≈ 𝐴 → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ (card‘𝐵)))
22		domen2 9186	. . . . . 6 ⊢ ((card‘𝐵) ≈ 𝐵 → (𝐴 ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
23	21, 22	sylan9bb 509	. . . . 5 ⊢ (((card‘𝐴) ≈ 𝐴 ∧ (card‘𝐵) ≈ 𝐵) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
24	13, 20, 23	syl2anc 583	. . . 4 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → ((card‘𝐴) ≼ (card‘𝐵) ↔ 𝐴 ≼ 𝐵))
25	11, 24	mpbid 232	. . 3 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ ((card‘𝐴) ≠ ∅ ∧ (card‘𝐴) ⊆ (card‘𝐵))) → 𝐴 ≼ 𝐵)
26	25	expr 456	. 2 ⊢ (((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) ∧ (card‘𝐴) ≠ ∅) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))
27	7, 26	pm2.61dane 3035	1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ 𝑉) → ((card‘𝐴) ⊆ (card‘𝐵) → 𝐴 ≼ 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108   ≠ wne 2946  Vcvv 3488   ⊆ wss 3976  ∅c0 4352   class class class wbr 5166  dom cdm 5700  ‘cfv 6573   ≈ cen 9000   ≼ cdom 9001  cardccrd 10004

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fo 6579  df-f1o 6580  df-fv 6581  df-er 8763  df-en 9004  df-dom 9005  df-card 10008

This theorem is referenced by:  carddom2  10046