Proof of Theorem f1ocnv
| Step | Hyp | Ref
| Expression |
| 1 | | df-rn 2429 |
. . . . . . . 8
⊢ ran F
= dom ◡F |
| 2 | 1 | cleq1i 1108 |
. . . . . . 7
⊢ (ran F
= B ↔ dom ◡F =
B) |
| 3 | 2 | anbi2i 367 |
. . . . . 6
⊢ ((Fun ◡F ∧
ran F = B) ↔ (Fun ◡F ∧
dom ◡F = B)) |
| 4 | | df-fn 2433 |
. . . . . 6
⊢ (◡F Fn
B ↔ (Fun ◡F ∧
dom ◡F = B)) |
| 5 | 3, 4 | bitr4 154 |
. . . . 5
⊢ ((Fun ◡F ∧
ran F = B) ↔ ◡F Fn
B) |
| 6 | 5 | biimp 133 |
. . . 4
⊢ ((Fun ◡F ∧
ran F = B) → ◡F Fn
B) |
| 7 | | fnfun 2721 |
. . . . . 6
⊢ (F Fn
A → Fun F) |
| 8 | | funcnvcnv 2701 |
. . . . . 6
⊢ (Fun F
→ Fun ◡◡F) |
| 9 | 7, 8 | syl 12 |
. . . . 5
⊢ (F Fn
A → Fun ◡◡F) |
| 10 | | fndm 2723 |
. . . . . 6
⊢ (F Fn
A → dom F = A) |
| 11 | | dfdm4 2525 |
. . . . . 6
⊢ dom F
= ran ◡F |
| 12 | 10, 11 | syl5eqr 1138 |
. . . . 5
⊢ (F Fn
A → ran ◡F =
A) |
| 13 | 9, 12 | jca 236 |
. . . 4
⊢ (F Fn
A → (Fun ◡◡F ∧
ran ◡F = A)) |
| 14 | 6, 13 | anim12i 268 |
. . 3
⊢ (((Fun ◡F ∧
ran F = B) ∧ F Fn
A) → (◡F Fn
B ∧ (Fun ◡◡F ∧
ran ◡F = A))) |
| 15 | 14 | ancoms 334 |
. 2
⊢ ((F Fn
A ∧ (Fun ◡F ∧
ran F = B)) → (◡F Fn
B ∧ (Fun ◡◡F ∧
ran ◡F = A))) |
| 16 | | f1o2 2804 |
. . 3
⊢ (F:A–1-1-onto→B ↔
(F Fn A
∧ Fun ◡F ∧ ran F =
B)) |
| 17 | | 3anass 585 |
. . 3
⊢ ((F Fn
A ∧ Fun ◡F ∧
ran F = B) ↔ (F Fn
A ∧ (Fun ◡F ∧
ran F = B))) |
| 18 | 16, 17 | bitr 151 |
. 2
⊢ (F:A–1-1-onto→B ↔
(F Fn A
∧ (Fun ◡F ∧ ran F =
B))) |
| 19 | | f1o2 2804 |
. . 3
⊢ (◡F:B–1-1-onto→A ↔
(◡F
Fn B ∧ Fun ◡◡F ∧
ran ◡F = A)) |
| 20 | | 3anass 585 |
. . 3
⊢ ((◡F Fn
B ∧ Fun ◡◡F ∧
ran ◡F = A) ↔
(◡F
Fn B ∧ (Fun ◡◡F ∧
ran ◡F = A))) |
| 21 | 19, 20 | bitr 151 |
. 2
⊢ (◡F:B–1-1-onto→A ↔
(◡F
Fn B ∧ (Fun ◡◡F ∧
ran ◡F = A))) |
| 22 | 15, 18, 21 | 3imtr4 192 |
1
⊢ (F:A–1-1-onto→B →
◡F:B–1-1-onto→A) |