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

Theorem carden2b 10048
Description: If two sets are equinumerous, then they have equal cardinalities. (This assertion and carden2a 10047 are meant to replace carden 10635 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 10046 . . . . 5 ((card‘𝐵) ∈ (card‘𝐴) → ¬ (card‘𝐵) ≈ 𝐴)
2 ennum 10028 . . . . . . . 8 (𝐴 ≈ 𝐵 → (𝐴 ∈ dom card ↔ 𝐵 ∈ dom card))
32biimpa 482 . . . . . . 7 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ∈ dom card)
4 cardid2 10034 . . . . . . 7 (𝐵 ∈ dom card → (card‘𝐵) ≈ 𝐵)
53, 4syl 18 . . . . . 6 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐵)
6 ensym 9030 . . . . . . 7 (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴)
76adantr 486 . . . . . 6 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → 𝐵 ≈ 𝐴)
8 entr 9033 . . . . . 6 (((card‘𝐵) ≈ 𝐵 ∧ 𝐵 ≈ 𝐴) → (card‘𝐵) ≈ 𝐴)
95, 7, 8syl2anc 596 . . . . 5 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐵) ≈ 𝐴)
101, 9nsyl3 139 . . . 4 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐵) ∈ (card‘𝐴))
11 cardon 10025 . . . . 5 (card‘𝐴) ∈ On
12 cardon 10025 . . . . 5 (card‘𝐵) ∈ On
13 ontri1 6397 . . . . 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 10046 . . . . 5 ((card‘𝐴) ∈ (card‘𝐵) → ¬ (card‘𝐴) ≈ 𝐵)
17 cardid2 10034 . . . . . 6 (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
18 id 23 . . . . . 6 (𝐴 ≈ 𝐵 → 𝐴 ≈ 𝐵)
19 entr 9033 . . . . . 6 (((card‘𝐴) ≈ 𝐴 ∧ 𝐴 ≈ 𝐵) → (card‘𝐴) ≈ 𝐵)
2017, 18, 19syl2anr 609 . . . . 5 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) ≈ 𝐵)
2116, 20nsyl3 139 . . . 4 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → ¬ (card‘𝐴) ∈ (card‘𝐵))
22 ontri1 6397 . . . . 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 3948 . 2 ((𝐴 ≈ 𝐵 ∧ 𝐴 ∈ dom card) → (card‘𝐴) = (card‘𝐵))
26 ndmfv 6917 . . . 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 6917 . . . 4 (¬ 𝐵 ∈ dom card → (card‘𝐵) = ∅)
3129, 30syl 18 . . 3 ((𝐴 ≈ 𝐵 ∧ ¬ 𝐴 ∈ dom card) → (card‘𝐵) = ∅)
3227, 31eqtr4d 2799 . 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 2145   ⊆ wss 3899  ∅c0 4279   class class class wbr 5103  dom cdm 5651  Oncon0 6362  ‘cfv 6538   ≈ cen 8970  cardccrd 10016
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6365  df-on 6366  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-er 8717  df-en 8974  df-card 10020
This theorem is used by:  card1  10049  carddom2  10058  cardennn  10064  cardsucinf  10065  pm54.43lem  10081  nnadju  10276  nnadjuALT  10277  ficardun  10279  ackbij1lem5  10301  ackbij1lem8  10304  ackbij1lem9  10305  ackbij2lem2  10317  carden  10635  r1tskina  10867  cardfz  14113  1enumcard  35724  acwer1prclem  35759  kardcard2b  35833
  Copyright terms: Public domain W3C validator