| 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 7119. (Contributed by AV, 10-Jan-2020.) |
| Ref | Expression |
|---|---|
| f1vrnfibi | ⊢ ((𝐹 ∈ 𝑉 ∧ 𝐹:𝐴–1-1→𝐵) → (𝐹 ∈ Fin ↔ ran 𝐹 ∈ Fin)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | f1dm 5538 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → dom 𝐹 = 𝐴) | |
| 2 | dmexg 4988 | . . . . 5 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V) | |
| 3 | eleq1 2292 | . . . . . 6 ⊢ (𝐴 = dom 𝐹 → (𝐴 ∈ V ↔ dom 𝐹 ∈ V)) | |
| 4 | 3 | eqcoms 2232 | . . . . 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 7119 | . 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 1395 ∈ wcel 2200 Vcvv 2799 dom cdm 4719 ran crn 4720 –1-1→wf1 5315 Fincfn 6895 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-1st 6292 df-2nd 6293 df-1o 6568 df-er 6688 df-en 6896 df-fin 6898 |
| This theorem is referenced by: negfi 11747 |
| Copyright terms: Public domain | W3C validator |