Theorem carden2b 9882

Description: If two sets are equinumerous, then they have equal cardinalities. (This assertion and carden2a 9881 are meant to replace carden 10464 in ZF without AC.) (Contributed by Mario Carneiro, 9-Jan-2013.) (Proof shortened by Mario Carneiro, 27-Apr-2015.)

Assertion

Ref	Expression
carden2b	⊢ (𝐴 ≈ 𝐵 → (card‘𝐴) = (card‘𝐵))

Proof of Theorem carden2b

Step	Hyp	Ref	Expression
1		cardne 9880	. . . . 5 ⊢ ((card‘𝐵) ∈ (card‘𝐴) → ¬ (card‘𝐵) ≈ 𝐴)
2		ennum 9862	. . . . . . . 8 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ dom card ↔ 𝐵 ∈ dom card))
3	2	biimpa 477	. . . . . . 7 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ∈ dom card)
4		cardid2 9868	. . . . . . 7 ⊢ (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
5	3, 4	syl 17	. . . . . 6 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐵)
6		ensym 8940	. . . . . . 7 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴)
7	6	adantr 481	. . . . . 6 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ≈ 𝐴)
8		entr 8943	. . . . . 6 ⊢ (((card‘𝐵) ≈ 𝐵 ∧ 𝐵 ≈ 𝐴) → (card‘𝐵) ≈ 𝐴)
9	5, 7, 8	syl2anc 590	. . . . 5 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐴)
10	1, 9	nsyl3 138	. . . 4 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐵) ∈ (card‘𝐴))
11		cardon 9859	. . . . 5 ⊢ (card‘𝐴) ∈ On
12		cardon 9859	. . . . 5 ⊢ (card‘𝐵) ∈ On
13		ontri1 6344	. . . . 5 ⊢ (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)))
14	11, 12, 13	mp2an 698	. . . 4 ⊢ ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))
15	10, 14	sylibr 235	. . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) ⊆ (card‘𝐵))
16		cardne 9880	. . . . 5 ⊢ ((card‘𝐴) ∈ (card‘𝐵) → ¬ (card‘𝐴) ≈ 𝐵)
17		cardid2 9868	. . . . . 6 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
18		id 22	. . . . . 6 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≈ 𝐵)
19		entr 8943	. . . . . 6 ⊢ (((card‘𝐴) ≈ 𝐴 ∧ 𝐴 ≈ 𝐵) → (card‘𝐴) ≈ 𝐵)
20	17, 18, 19	syl2anr 603	. . . . 5 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) ≈ 𝐵)
21	16, 20	nsyl3 138	. . . 4 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐴) ∈ (card‘𝐵))
22		ontri1 6344	. . . . 5 ⊢ (((card‘𝐵) ∈ On ∧ (card‘𝐴) ∈ On) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵)))
23	12, 11, 22	mp2an 698	. . . 4 ⊢ ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵))
24	21, 23	sylibr 235	. . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ⊆ (card‘𝐴))
25	15, 24	eqssd 3932	. 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
26		ndmfv 6859	. . . 4 ⊢ (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅)
27	26	adantl 482	. . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = ∅)
28	2	notbid 319	. . . . 5 ⊢ (𝐴 ≈ 𝐵 → (¬ 𝐴 ∈ dom card ↔ ¬ 𝐵 ∈ dom card))
29	28	biimpa 477	. . . 4 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → ¬ 𝐵 ∈ dom card)
30		ndmfv 6859	. . . 4 ⊢ (¬ 𝐵 ∈ dom card → (card‘𝐵) = ∅)
31	29, 30	syl 17	. . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐵) = ∅)
32	27, 31	eqtr4d 2777	. 2 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
33	25, 32	pm2.61dan 818	1 ⊢ (𝐴 ≈ 𝐵 → (card‘𝐴) = (card‘𝐵))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547   ∈ wcel 2119   ⊆ wss 3883  ∅c0 4261   class class class wbr 5072  dom cdm 5618  Oncon0 6310  ‘cfv 6485   ≈ cen 8880  cardccrd 9850

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-ord 6313  df-on 6314  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-er 8633  df-en 8884  df-card 9854

This theorem is referenced by:  card1  9883  carddom2  9892  cardennn  9898  cardsucinf  9899  pm54.43lem  9915  nnadju  10111  nnadjuALT  10112  ficardun  10114  ackbij1lem5  10136  ackbij1lem8  10139  ackbij1lem9  10140  ackbij2lem2  10152  carden  10464  r1tskina  10696  cardfz  13923