| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fcof1oinvd | Structured version Visualization version GIF version | ||
| Description: Show that a function is the inverse of a bijective function if their composition is the identity function. Formerly part of proof of fcof1o 7300. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by AV, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| fcof1oinvd.f | ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵) |
| fcof1oinvd.g | ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) |
| fcof1oinvd.b | ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵)) |
| Ref | Expression |
|---|---|
| fcof1oinvd | ⊢ (𝜑 → ◡𝐹 = 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fcof1oinvd.b | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵)) | |
| 2 | 1 | coeq2d 5846 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵))) |
| 3 | coass 6266 | . . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺)) | |
| 4 | fcof1oinvd.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵) | |
| 5 | f1ococnv1 6851 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) |
| 7 | 6 | coeq1d 5845 | . . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺)) |
| 8 | fcof1oinvd.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) | |
| 9 | fcoi2 6754 | . . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) |
| 11 | 7, 10 | eqtrd 2797 | . . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺) |
| 12 | 3, 11 | eqtr3id 2811 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺) |
| 13 | f1ocnv 6834 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 14 | f1of 6821 | . . 3 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 15 | fcoi1 6753 | . . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) | |
| 16 | 4, 13, 14, 15 | 4syl 20 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) |
| 17 | 2, 12, 16 | 3eqtr3rd 2806 | 1 ⊢ (𝜑 → ◡𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 I cid 5553 ◡ccnv 5658 ↾ cres 5661 ∘ ccom 5663 ⟶wf 6533 –1-1-onto→wf1o 6536 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 |
| This theorem is used by: 2fcoidinvd 7299 |
| Copyright terms: Public domain | W3C validator |