| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > f1vrnfibi | GIF version | ||
| Description: A one-to-one function which is a set is finite if and only if its range is finite. See also f1dmvrnfibi 7148. (Contributed by AV, 10-Jan-2020.) |
| Ref | Expression |
|---|---|
| f1vrnfibi | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹 ∈ Fin ↔ ran 𝐹 ∈ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1dm 5550 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → dom 𝐹 = 𝐴) | |
| 2 | dmexg 4998 | . . . . 5 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V) | |
| 3 | eleq1 2293 | . . . . . 6 ⊢ (𝐴 = dom 𝐹 → (𝐴 ∈ V ↔ dom 𝐹 ∈ V)) | |
| 4 | 3 | eqcoms 2233 | . . . . 5 ⊢ (dom 𝐹 = 𝐴 → (𝐴 ∈ V ↔ dom 𝐹 ∈ V)) |
| 5 | 2, 4 | imbitrrid 156 | . . . 4 ⊢ (dom 𝐹 = 𝐴 → (𝐹 ∈ 𝑉 → 𝐴 ∈ V)) |
| 6 | 1, 5 | syl 14 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → (𝐹 ∈ 𝑉 → 𝐴 ∈ V)) |
| 7 | 6 | impcom 125 | . 2 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → 𝐴 ∈ V) |
| 8 | f1dmvrnfibi 7148 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹 ∈ Fin ↔ ran 𝐹 ∈ Fin)) | |
| 9 | 7, 8 | sylancom 420 | 1 ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹 ∈ Fin ↔ ran 𝐹 ∈ Fin)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1397 ∈ wcel 2201 Vcvv 2801 dom cdm 4727 ran crn 4728 –1-1→wf1 5325 Fincfn 6914 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2203 ax-14 2204 ax-ext 2212 ax-coll 4205 ax-sep 4208 ax-nul 4216 ax-pow 4266 ax-pr 4301 ax-un 4532 ax-setind 4637 ax-iinf 4688 |
| This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1810 df-eu 2081 df-mo 2082 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-ne 2402 df-ral 2514 df-rex 2515 df-reu 2516 df-rab 2518 df-v 2803 df-sbc 3031 df-csb 3127 df-dif 3201 df-un 3203 df-in 3205 df-ss 3212 df-nul 3494 df-if 3605 df-pw 3655 df-sn 3676 df-pr 3677 df-op 3679 df-uni 3895 df-int 3930 df-iun 3973 df-br 4090 df-opab 4152 df-mpt 4153 df-tr 4189 df-id 4392 df-iord 4465 df-on 4467 df-suc 4470 df-iom 4691 df-xp 4733 df-rel 4734 df-cnv 4735 df-co 4736 df-dm 4737 df-rn 4738 df-res 4739 df-ima 4740 df-iota 5288 df-fun 5330 df-fn 5331 df-f 5332 df-f1 5333 df-fo 5334 df-f1o 5335 df-fv 5336 df-1st 6308 df-2nd 6309 df-1o 6587 df-er 6707 df-en 6915 df-fin 6917 |
| This theorem is referenced by: negfi 11811 |
| Copyright terms: Public domain | W3C validator |