New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > dffn4 | GIF version |
Description: A function maps onto its range. (Contributed by set.mm contributors, 10-May-1998.) |
Ref | Expression |
---|---|
dffn4 | ⊢ (F Fn A ↔ F:A–onto→ran F) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2353 | . . 3 ⊢ ran F = ran F | |
2 | 1 | biantru 491 | . 2 ⊢ (F Fn A ↔ (F Fn A ∧ ran F = ran F)) |
3 | df-fo 4794 | . 2 ⊢ (F:A–onto→ran F ↔ (F Fn A ∧ ran F = ran F)) | |
4 | 2, 3 | bitr4i 243 | 1 ⊢ (F Fn A ↔ F:A–onto→ran F) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 176 ∧ wa 358 = wceq 1642 ran crn 4774 Fn wfn 4777 –onto→wfo 4780 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-ext 2334 |
This theorem depends on definitions: df-bi 177 df-an 360 df-cleq 2346 df-fo 4794 |
This theorem is referenced by: funforn 5277 ffoss 5315 mapsn 6027 |
Copyright terms: Public domain | W3C validator |