![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > hasheni | Structured version Visualization version GIF version |
Description: Equinumerous sets have the same number of elements (even if they are not finite). (Contributed by Mario Carneiro, 15-Apr-2015.) |
Ref | Expression |
---|---|
hasheni | ⊢ (𝐴 ≈ 𝐵 → (♯‘𝐴) = (♯‘𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 483 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ≈ 𝐵) | |
2 | enfii 8581 | . . . . 5 ⊢ ((𝐵 ∈ Fin ∧ 𝐴 ≈ 𝐵) → 𝐴 ∈ Fin) | |
3 | 2 | ancoms 459 | . . . 4 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → 𝐴 ∈ Fin) |
4 | hashen 13557 | . . . 4 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘𝐴) = (♯‘𝐵) ↔ 𝐴 ≈ 𝐵)) | |
5 | 3, 4 | sylancom 588 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → ((♯‘𝐴) = (♯‘𝐵) ↔ 𝐴 ≈ 𝐵)) |
6 | 1, 5 | mpbird 258 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐵 ∈ Fin) → (♯‘𝐴) = (♯‘𝐵)) |
7 | relen 8362 | . . . . 5 ⊢ Rel ≈ | |
8 | 7 | brrelex1i 5494 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
9 | enfi 8580 | . . . . . 6 ⊢ (𝐴 ≈ 𝐵 → (𝐴 ∈ Fin ↔ 𝐵 ∈ Fin)) | |
10 | 9 | notbid 319 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → (¬ 𝐴 ∈ Fin ↔ ¬ 𝐵 ∈ Fin)) |
11 | 10 | biimpar 478 | . . . 4 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐵 ∈ Fin) → ¬ 𝐴 ∈ Fin) |
12 | hashinf 13545 | . . . 4 ⊢ ((𝐴 ∈ V ∧ ¬ 𝐴 ∈ Fin) → (♯‘𝐴) = +∞) | |
13 | 8, 11, 12 | syl2an2r 681 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐵 ∈ Fin) → (♯‘𝐴) = +∞) |
14 | 7 | brrelex2i 5495 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
15 | hashinf 13545 | . . . 4 ⊢ ((𝐵 ∈ V ∧ ¬ 𝐵 ∈ Fin) → (♯‘𝐵) = +∞) | |
16 | 14, 15 | sylan 580 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐵 ∈ Fin) → (♯‘𝐵) = +∞) |
17 | 13, 16 | eqtr4d 2834 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ ¬ 𝐵 ∈ Fin) → (♯‘𝐴) = (♯‘𝐵)) |
18 | 6, 17 | pm2.61dan 809 | 1 ⊢ (𝐴 ≈ 𝐵 → (♯‘𝐴) = (♯‘𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1522 ∈ wcel 2081 Vcvv 3437 class class class wbr 4962 ‘cfv 6225 ≈ cen 8354 Fincfn 8357 +∞cpnf 10518 ♯chash 13540 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-13 2344 ax-ext 2769 ax-sep 5094 ax-nul 5101 ax-pow 5157 ax-pr 5221 ax-un 7319 ax-cnex 10439 ax-resscn 10440 ax-1cn 10441 ax-icn 10442 ax-addcl 10443 ax-addrcl 10444 ax-mulcl 10445 ax-mulrcl 10446 ax-mulcom 10447 ax-addass 10448 ax-mulass 10449 ax-distr 10450 ax-i2m1 10451 ax-1ne0 10452 ax-1rid 10453 ax-rnegex 10454 ax-rrecex 10455 ax-cnre 10456 ax-pre-lttri 10457 ax-pre-lttrn 10458 ax-pre-ltadd 10459 ax-pre-mulgt0 10460 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1762 df-nf 1766 df-sb 2043 df-mo 2576 df-eu 2612 df-clab 2776 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ne 2985 df-nel 3091 df-ral 3110 df-rex 3111 df-reu 3112 df-rab 3114 df-v 3439 df-sbc 3707 df-csb 3812 df-dif 3862 df-un 3864 df-in 3866 df-ss 3874 df-pss 3876 df-nul 4212 df-if 4382 df-pw 4455 df-sn 4473 df-pr 4475 df-tp 4477 df-op 4479 df-uni 4746 df-int 4783 df-iun 4827 df-br 4963 df-opab 5025 df-mpt 5042 df-tr 5064 df-id 5348 df-eprel 5353 df-po 5362 df-so 5363 df-fr 5402 df-we 5404 df-xp 5449 df-rel 5450 df-cnv 5451 df-co 5452 df-dm 5453 df-rn 5454 df-res 5455 df-ima 5456 df-pred 6023 df-ord 6069 df-on 6070 df-lim 6071 df-suc 6072 df-iota 6189 df-fun 6227 df-fn 6228 df-f 6229 df-f1 6230 df-fo 6231 df-f1o 6232 df-fv 6233 df-riota 6977 df-ov 7019 df-oprab 7020 df-mpo 7021 df-om 7437 df-wrecs 7798 df-recs 7860 df-rdg 7898 df-er 8139 df-en 8358 df-dom 8359 df-sdom 8360 df-fin 8361 df-card 9214 df-pnf 10523 df-mnf 10524 df-xr 10525 df-ltxr 10526 df-le 10527 df-sub 10719 df-neg 10720 df-nn 11487 df-n0 11746 df-z 11830 df-uz 12094 df-hash 13541 |
This theorem is referenced by: hashen1 13580 hashfn 13584 hashfz 13636 hashf1lem2 13662 ishashinf 13669 hashgcdeq 15955 ramub2 16179 ram0 16187 odhash 18429 odhash2 18430 odngen 18432 lsmhash 18558 znhash 20387 znunithash 20393 cyggic 20401 birthdaylem2 25212 lgsquadlem1 25638 lgsquadlem2 25639 lgsquadlem3 25640 wlknwwlksneqs 27355 numclwwlk1 27832 dimval 30605 dimvalfi 30606 dimkerim 30627 fedgmul 30631 eulerpart 31257 ballotlemro 31397 ballotlemfrc 31401 ballotlem8 31411 rp-isfinite5 39368 |
Copyright terms: Public domain | W3C validator |