| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dff1o4 | GIF version | ||
| Description: Alternate definition of one-to-one onto function. (Contributed by NM, 25-Mar-1998.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) |
| Ref | Expression |
|---|---|
| dff1o4 | ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dff1o2 5536 | . 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = 𝐵)) | |
| 2 | 3anass 985 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = 𝐵) ↔ (𝐹 Fn 𝐴 ∧ (Fun ◡𝐹 ∧ ran 𝐹 = 𝐵))) | |
| 3 | df-rn 4691 | . . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹 | |
| 4 | 3 | eqeq1i 2214 | . . . . 5 ⊢ (ran 𝐹 = 𝐵 ↔ dom ◡𝐹 = 𝐵) |
| 5 | 4 | anbi2i 457 | . . . 4 ⊢ ((Fun ◡𝐹 ∧ ran 𝐹 = 𝐵) ↔ (Fun ◡𝐹 ∧ dom ◡𝐹 = 𝐵)) |
| 6 | df-fn 5280 | . . . 4 ⊢ (◡𝐹 Fn 𝐵 ↔ (Fun ◡𝐹 ∧ dom ◡𝐹 = 𝐵)) | |
| 7 | 5, 6 | bitr4i 187 | . . 3 ⊢ ((Fun ◡𝐹 ∧ ran 𝐹 = 𝐵) ↔ ◡𝐹 Fn 𝐵) |
| 8 | 7 | anbi2i 457 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ (Fun ◡𝐹 ∧ ran 𝐹 = 𝐵)) ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) |
| 9 | 1, 2, 8 | 3bitri 206 | 1 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: ∧ wa 104 ↔ wb 105 ∧ w3a 981 = wceq 1373 ◡ccnv 4679 dom cdm 4680 ran crn 4681 Fun wfun 5271 Fn wfn 5272 –1-1-onto→wf1o 5276 |
| 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 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-11 1530 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-in 3174 df-ss 3181 df-rn 4691 df-fn 5280 df-f 5281 df-f1 5282 df-fo 5283 df-f1o 5284 |
| This theorem is referenced by: f1ocnv 5544 f1oun 5551 f1o00 5567 f1oi 5570 f1osn 5572 f1ompt 5741 f1ofveu 5942 f1ocnvd 6158 f1od2 6331 mapsnf1o2 6793 sbthlemi9 7079 xnn0nnen 10595 nninfctlemfo 12411 mhmf1o 13352 grpinvf1o 13452 ghmf1o 13661 rhmf1o 13980 hmeof1o2 14830 |
| Copyright terms: Public domain | W3C validator |