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

Theorem carden2b 10085
Description: If two sets are equinumerous, then they have equal cardinalities. (This assertion and carden2a 10084 are meant to replace carden 10674 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 10083 . . . . 5 ((card‘𝐵) ∈ (card‘𝐴) → ¬ (card‘𝐵) ≈ 𝐴)
2 ennum 10065 . . . . . . . 8 (𝐴 ≈ 𝐵 → (𝐴 ∈ dom card ↔ 𝐵 ∈ dom card))
32biimpa 482 . . . . . . 7 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ∈ dom card)
4 cardid2 10071 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
53, 4syl 18 . . . . . 6 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐵)
6 ensym 9068 . . . . . . 7 (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴)
76adantr 486 . . . . . 6 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ≈ 𝐴)
8 entr 9071 . . . . . 6 (((card‘𝐵) ≈ 𝐵 ∧ 𝐵 ≈ 𝐴) → (card‘𝐵) ≈ 𝐴)
95, 7, 8syl2anc 596 . . . . 5 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐴)
101, 9nsyl3 139 . . . 4 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐵) ∈ (card‘𝐴))
11 cardon 10062 . . . . 5 (card‘𝐴) ∈ On
12 cardon 10062 . . . . 5 (card‘𝐵) ∈ On
13 ontri1 6423 . . . . 5 (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)))
1411, 12, 13mp2an 705 . . . 4 ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))
1510, 14sylibr 237 . . 3 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) ⊆ (card‘𝐵))
16 cardne 10083 . . . . 5 ((card‘𝐴) ∈ (card‘𝐵) → ¬ (card‘𝐴) ≈ 𝐵)
17 cardid2 10071 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
18 id 23 . . . . . 6 (𝐴 ≈ 𝐵 → 𝐴 ≈ 𝐵)
19 entr 9071 . . . . . 6 (((card‘𝐴) ≈ 𝐴 ∧ 𝐴 ≈ 𝐵) → (card‘𝐴) ≈ 𝐵)
2017, 18, 19syl2anr 609 . . . . 5 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) ≈ 𝐵)
2116, 20nsyl3 139 . . . 4 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐴) ∈ (card‘𝐵))
22 ontri1 6423 . . . . 5 (((card‘𝐵) ∈ On ∧ (card‘𝐴) ∈ On) → ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵)))
2312, 11, 22mp2an 705 . . . 4 ((card‘𝐵) ⊆ (card‘𝐴) ↔ ¬ (card‘𝐴) ∈ (card‘𝐵))
2421, 23sylibr 237 . . 3 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ⊆ (card‘𝐴))
2515, 24eqssd 3930 . 2 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
26 ndmfv 6948 . . . 4 (¬ 𝐴 ∈ dom card → (card‘𝐴) = ∅)
2726adantl 487 . . 3 ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = ∅)
282notbid 321 . . . . 5 (𝐴 ≈ 𝐵 → (¬ 𝐴 ∈ dom card ↔ ¬ 𝐵 ∈ dom card))
2928biimpa 482 . . . 4 ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → ¬ 𝐵 ∈ dom card)
30 ndmfv 6948 . . . 4 (¬ 𝐵 ∈ dom card → (card‘𝐵) = ∅)
3129, 30syl 18 . . 3 ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐵) = ∅)
3227, 31eqtr4d 2801 . 2 ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
3325, 32pm2.61dan 825 1 (𝐴 ≈ 𝐵 → (card‘𝐴) = (card‘𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∅c0 4281   class class class wbr 5108  dom cdm 5658  Oncon0 6388  ‘cfv 6566   ≈ cen 9008  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-card 10057
This theorem is used by:  card1  10086  carddom2  10095  cardennn  10103  cardsucinf  10104  pm54.43lem  10120  nnadju  10315  nnadjuALT  10316  ficardun  10318  ackbij1lem5  10340  ackbij1lem8  10343  ackbij1lem9  10344  ackbij2lem2  10356  carden  10674  r1tskina  10906  cardfz  14153  1enumcard  35849  acwer1prclem  35892  kardcard2b  35974
  Copyright terms: Public domain W3C validator