Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > hasheqf1o | GIF version |
Description: The size of two finite sets is equal if and only if there is a bijection mapping one of the sets onto the other. (Contributed by Alexander van der Vekens, 17-Dec-2017.) |
Ref | Expression |
---|---|
hasheqf1o | ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘𝐴) = (♯‘𝐵) ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hashen 10707 | . 2 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘𝐴) = (♯‘𝐵) ↔ 𝐴 ≈ 𝐵)) | |
2 | bren 6722 | . 2 ⊢ (𝐴 ≈ 𝐵 ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵) | |
3 | 1, 2 | bitrdi 195 | 1 ⊢ ((𝐴 ∈ Fin ∧ 𝐵 ∈ Fin) → ((♯‘𝐴) = (♯‘𝐵) ↔ ∃𝑓 𝑓:𝐴–1-1-onto→𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1348 ∃wex 1485 ∈ wcel 2141 class class class wbr 3987 –1-1-onto→wf1o 5195 ‘cfv 5196 ≈ cen 6713 Fincfn 6715 ♯chash 10698 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-coll 4102 ax-sep 4105 ax-nul 4113 ax-pow 4158 ax-pr 4192 ax-un 4416 ax-setind 4519 ax-iinf 4570 ax-cnex 7854 ax-resscn 7855 ax-1cn 7856 ax-1re 7857 ax-icn 7858 ax-addcl 7859 ax-addrcl 7860 ax-mulcl 7861 ax-addcom 7863 ax-addass 7865 ax-distr 7867 ax-i2m1 7868 ax-0lt1 7869 ax-0id 7871 ax-rnegex 7872 ax-cnre 7874 ax-pre-ltirr 7875 ax-pre-ltwlin 7876 ax-pre-lttrn 7877 ax-pre-ltadd 7879 |
This theorem depends on definitions: df-bi 116 df-dc 830 df-3or 974 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-csb 3050 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-nul 3415 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-int 3830 df-iun 3873 df-br 3988 df-opab 4049 df-mpt 4050 df-tr 4086 df-id 4276 df-iord 4349 df-on 4351 df-ilim 4352 df-suc 4354 df-iom 4573 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-rn 4620 df-res 4621 df-ima 4622 df-iota 5158 df-fun 5198 df-fn 5199 df-f 5200 df-f1 5201 df-fo 5202 df-f1o 5203 df-fv 5204 df-riota 5807 df-ov 5854 df-oprab 5855 df-mpo 5856 df-recs 6282 df-frec 6368 df-er 6510 df-en 6716 df-dom 6717 df-fin 6718 df-pnf 7945 df-mnf 7946 df-xr 7947 df-ltxr 7948 df-le 7949 df-sub 8081 df-neg 8082 df-inn 8868 df-n0 9125 df-z 9202 df-uz 9477 df-ihash 10699 |
This theorem is referenced by: fihasheqf1oi 10711 |
Copyright terms: Public domain | W3C validator |