| 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 5550 | . 2 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = 𝐵)) | |
| 2 | 3anass 985 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ Fun ◡𝐹 ∧ ran 𝐹 = 𝐵) ↔ (𝐹 Fn 𝐴 ∧ (Fun ◡𝐹 ∧ ran 𝐹 = 𝐵))) | |
| 3 | df-rn 4705 | . . . . . 6 ⊢ ran 𝐹 = dom ◡𝐹 | |
| 4 | 3 | eqeq1i 2215 | . . . . 5 ⊢ (ran 𝐹 = 𝐵 ↔ dom ◡𝐹 = 𝐵) |
| 5 | 4 | anbi2i 457 | . . . 4 ⊢ ((Fun ◡𝐹 ∧ ran 𝐹 = 𝐵) ↔ (Fun ◡𝐹 ∧ dom ◡𝐹 = 𝐵)) |
| 6 | df-fn 5294 | . . . 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 4693 dom cdm 4694 ran crn 4695 Fun wfun 5285 Fn wfn 5286 –1-1-onto→wf1o 5290 |
| 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 2189 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-in 3181 df-ss 3188 df-rn 4705 df-fn 5294 df-f 5295 df-f1 5296 df-fo 5297 df-f1o 5298 |
| This theorem is referenced by: f1ocnv 5558 f1oun 5565 f1o00 5581 f1oi 5584 f1osn 5586 f1ompt 5756 f1ofveu 5957 f1ocnvd 6173 f1od2 6346 mapsnf1o2 6808 sbthlemi9 7095 xnn0nnen 10621 nninfctlemfo 12522 mhmf1o 13463 grpinvf1o 13563 ghmf1o 13772 rhmf1o 14091 hmeof1o2 14941 |
| Copyright terms: Public domain | W3C validator |