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

Theorem carden2b 9927
Description: If two sets are equinumerous, then they have equal cardinalities. (This assertion and carden2a 9926 are meant to replace carden 10511 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
StepHypRef Expression
1 cardne 9925 . . . . 5 ((card‘𝐵) ∈ (card‘𝐴) → ¬ (card‘𝐵) ≈ 𝐴)
2 ennum 9907 . . . . . . . 8 (𝐴𝐵 → (𝐴 ∈ dom card ↔ 𝐵 ∈ dom card))
32biimpa 476 . . . . . . 7 ((𝐴𝐵𝐴 ∈ dom card) → 𝐵 ∈ dom card)
4 cardid2 9913 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
53, 4syl 17 . . . . . 6 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐵)
6 ensym 8977 . . . . . . 7 (𝐴𝐵𝐵𝐴)
76adantr 480 . . . . . 6 ((𝐴𝐵𝐴 ∈ dom card) → 𝐵𝐴)
8 entr 8980 . . . . . 6 (((card‘𝐵) ≈ 𝐵𝐵𝐴) → (card‘𝐵) ≈ 𝐴)
95, 7, 8syl2anc 584 . . . . 5 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐴)
101, 9nsyl3 138 . . . 4 ((𝐴𝐵𝐴 ∈ dom card) → ¬ (card‘𝐵) ∈ (card‘𝐴))
11 cardon 9904 . . . . 5 (card‘𝐴) ∈ On
12 cardon 9904 . . . . 5 (card‘𝐵) ∈ On
13 ontri1 6369 . . . . 5 (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)))
1411, 12, 13mp2an 692 . . . 4 ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))
1510, 14sylibr 234 . . 3 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) ⊆ (card‘𝐵))
16 cardne 9925 . . . . 5 ((card‘𝐴) ∈ (card‘𝐵) → ¬ (card‘𝐴) ≈ 𝐵)
17 cardid2 9913 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
18 id 22 . . . . . 6 (𝐴𝐵𝐴𝐵)
19 entr 8980 . . . . . 6 (((card‘𝐴) ≈ 𝐴𝐴𝐵) → (card‘𝐴) ≈ 𝐵)
2017, 18, 19syl2anr 597 . . . . 5 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) ≈ 𝐵)
2116, 20nsyl3 138 . . . 4 ((𝐴𝐵𝐴 ∈ dom card) → ¬ (card‘𝐴) ∈ (card‘𝐵))
22 ontri1 6369 . . . . 5 (((card‘𝐵) ∈ On ∧ (card‘𝐴) ∈ On) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵)))
2312, 11, 22mp2an 692 . . . 4 ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵))
2421, 23sylibr 234 . . 3 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ⊆ (card‘𝐴))
2515, 24eqssd 3967 . 2 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
26 ndmfv 6896 . . . 4 𝐴 ∈ dom card → (card‘𝐴) = ∅)
2726adantl 481 . . 3 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = ∅)
282notbid 318 . . . . 5 (𝐴𝐵 → (¬ 𝐴 ∈ dom card ↔ ¬ 𝐵 ∈ dom card))
2928biimpa 476 . . . 4 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → ¬ 𝐵 ∈ dom card)
30 ndmfv 6896 . . . 4 𝐵 ∈ dom card → (card‘𝐵) = ∅)
3129, 30syl 17 . . 3 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐵) = ∅)
3227, 31eqtr4d 2768 . 2 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
3325, 32pm2.61dan 812 1 (𝐴𝐵 → (card‘𝐴) = (card‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395   = wceq 1540  wcel 2109  wss 3917  c0 4299   class class class wbr 5110  dom cdm 5641  Oncon0 6335  cfv 6514  cen 8918  cardccrd 9895
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714
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 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-int 4914  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-ord 6338  df-on 6339  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-er 8674  df-en 8922  df-card 9899
This theorem is referenced by:  card1  9928  carddom2  9937  cardennn  9943  cardsucinf  9944  pm54.43lem  9960  nnadju  10158  nnadjuALT  10159  ficardun  10161  ackbij1lem5  10183  ackbij1lem8  10186  ackbij1lem9  10187  ackbij2lem2  10199  carden  10511  r1tskina  10742  cardfz  13942
  Copyright terms: Public domain W3C validator