| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dffn3 | GIF version | ||
| Description: A function maps to its range. (Contributed by NM, 1-Sep-1999.) |
| Ref | Expression |
|---|---|
| dffn3 | ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssid 3212 | . . 3 ⊢ ran 𝐹 ⊆ ran 𝐹 | |
| 2 | 1 | biantru 302 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ ran 𝐹)) |
| 3 | df-f 5272 | . 2 ⊢ (𝐹:𝐴⟶ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ ran 𝐹)) | |
| 4 | 2, 3 | bitr4i 187 | 1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶ran 𝐹) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ⊆ wss 3165 ran crn 4674 Fn wfn 5263 ⟶wf 5264 |
| 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-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-11 1528 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-nf 1483 df-sb 1785 df-clab 2191 df-cleq 2197 df-clel 2200 df-in 3171 df-ss 3178 df-f 5272 |
| This theorem is referenced by: fsn2 5748 fo2ndf 6303 |
| Copyright terms: Public domain | W3C validator |