![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > dff1o5 | Structured version Visualization version GIF version |
Description: Alternate definition of one-to-one onto function. (Contributed by NM, 10-Dec-2003.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
Ref | Expression |
---|---|
dff1o5 | ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-f1o 6580 | . 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵)) | |
2 | dffo2 6838 | . . . 4 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵)) | |
3 | f1f 6817 | . . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵) | |
4 | 3 | biantrurd 532 | . . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → (ran 𝐹 = 𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ran 𝐹 = 𝐵))) |
5 | 2, 4 | bitr4id 290 | . . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → (𝐹:𝐴–onto→𝐵 ↔ ran 𝐹 = 𝐵)) |
6 | 5 | pm5.32i 574 | . 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐹:𝐴–onto→𝐵) ↔ (𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 = 𝐵)) |
7 | 1, 6 | bitri 275 | 1 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹:𝐴–1-1→𝐵 ∧ ran 𝐹 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1537 ran crn 5701 ⟶wf 6569 –1-1→wf1 6570 –onto→wfo 6571 –1-1-onto→wf1o 6572 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1778 df-cleq 2732 df-ss 3993 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 |
This theorem is referenced by: f1orescnv 6877 domdifsn 9120 sucdom2OLD 9148 sucdom2 9269 ackbij1 10306 ackbij2 10311 fin4en1 10378 om2uzf1oi 14004 s4f1o 14967 fvcosymgeq 19471 indlcim 21883 2lgslem1b 27454 ausgrusgrb 29200 usgrexmpledg 29297 wrdpmtrlast 33086 cdleme50f1o 40503 diaf1oN 41087 aks6d1c2 42087 pwssplit4 43046 cantnf2 43287 meadjiunlem 46386 |
Copyright terms: Public domain | W3C validator |