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

Theorem carden2b 9925
Description: If two sets are equinumerous, then they have equal cardinalities. (This assertion and carden2a 9924 are meant to replace carden 10508 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 9923 . . . . 5 ((card‘𝐵) ∈ (card‘𝐴) → ¬ (card‘𝐵) ≈ 𝐴)
2 ennum 9905 . . . . . . . 8 (𝐴𝐵 → (𝐴 ∈ dom card ↔ 𝐵 ∈ dom card))
32biimpa 480 . . . . . . 7 ((𝐴𝐵𝐴 ∈ dom card) → 𝐵 ∈ dom card)
4 cardid2 9911 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
53, 4syl 17 . . . . . 6 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐵)
6 ensym 8984 . . . . . . 7 (𝐴𝐵𝐵𝐴)
76adantr 484 . . . . . 6 ((𝐴𝐵𝐴 ∈ dom card) → 𝐵𝐴)
8 entr 8987 . . . . . 6 (((card‘𝐵) ≈ 𝐵𝐵𝐴) → (card‘𝐵) ≈ 𝐴)
95, 7, 8syl2anc 593 . . . . 5 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐴)
101, 9nsyl3 138 . . . 4 ((𝐴𝐵𝐴 ∈ dom card) → ¬ (card‘𝐵) ∈ (card‘𝐴))
11 cardon 9902 . . . . 5 (card‘𝐴) ∈ On
12 cardon 9902 . . . . 5 (card‘𝐵) ∈ On
13 ontri1 6380 . . . . 5 (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)))
1411, 12, 13mp2an 702 . . . 4 ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))
1510, 14sylibr 236 . . 3 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) ⊆ (card‘𝐵))
16 cardne 9923 . . . . 5 ((card‘𝐴) ∈ (card‘𝐵) → ¬ (card‘𝐴) ≈ 𝐵)
17 cardid2 9911 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
18 id 22 . . . . . 6 (𝐴𝐵𝐴𝐵)
19 entr 8987 . . . . . 6 (((card‘𝐴) ≈ 𝐴𝐴𝐵) → (card‘𝐴) ≈ 𝐵)
2017, 18, 19syl2anr 606 . . . . 5 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) ≈ 𝐵)
2116, 20nsyl3 138 . . . 4 ((𝐴𝐵𝐴 ∈ dom card) → ¬ (card‘𝐴) ∈ (card‘𝐵))
22 ontri1 6380 . . . . 5 (((card‘𝐵) ∈ On ∧ (card‘𝐴) ∈ On) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵)))
2312, 11, 22mp2an 702 . . . 4 ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵))
2421, 23sylibr 236 . . 3 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐵) ⊆ (card‘𝐴))
2515, 24eqssd 3953 . 2 ((𝐴𝐵𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
26 ndmfv 6899 . . . 4 𝐴 ∈ dom card → (card‘𝐴) = ∅)
2726adantl 485 . . 3 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = ∅)
282notbid 320 . . . . 5 (𝐴𝐵 → (¬ 𝐴 ∈ dom card ↔ ¬ 𝐵 ∈ dom card))
2928biimpa 480 . . . 4 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → ¬ 𝐵 ∈ dom card)
30 ndmfv 6899 . . . 4 𝐵 ∈ dom card → (card‘𝐵) = ∅)
3129, 30syl 17 . . 3 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐵) = ∅)
3227, 31eqtr4d 2800 . 2 ((𝐴𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
3325, 32pm2.61dan 822 1 (𝐴𝐵 → (card‘𝐴) = (card‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399   = wceq 1560  wcel 2142  wss 3904  c0 4285   class class class wbr 5100  dom cdm 5647  Oncon0 6346  cfv 6521  cen 8924  cardccrd 9893
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6349  df-on 6350  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-er 8678  df-en 8928  df-card 9897
This theorem is referenced by:  card1  9926  carddom2  9935  cardennn  9941  cardsucinf  9942  pm54.43lem  9958  nnadju  10154  nnadjuALT  10155  ficardun  10157  ackbij1lem5  10179  ackbij1lem8  10182  ackbij1lem9  10183  ackbij2lem2  10195  carden  10508  r1tskina  10740  cardfz  13983
  Copyright terms: Public domain W3C validator