![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dffn4 | GIF version |
Description: A function maps onto its range. (Contributed by NM, 10-May-1998.) |
Ref | Expression |
---|---|
dffn4 | ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴–onto→ran 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2115 | . . 3 ⊢ ran 𝐹 = ran 𝐹 | |
2 | 1 | biantru 298 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = ran 𝐹)) |
3 | df-fo 5087 | . 2 ⊢ (𝐹:𝐴–onto→ran 𝐹 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 = ran 𝐹)) | |
4 | 2, 3 | bitr4i 186 | 1 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴–onto→ran 𝐹) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1314 ran crn 4500 Fn wfn 5076 –onto→wfo 5079 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-gen 1408 ax-ext 2097 |
This theorem depends on definitions: df-bi 116 df-cleq 2108 df-fo 5087 |
This theorem is referenced by: funforn 5310 ffoss 5355 tposf2 6119 mapsn 6538 fifo 6820 |
Copyright terms: Public domain | W3C validator |