| 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 7324. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by AV, 15-Dec-2019.) |
| Ref | Expression |
|---|---|
| fcof1oinvd.f | ⊢ (𝜑 → 𝐹:𝐴⟶1-1onto𝐵) |
| fcof1oinvd.g | ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) |
| fcof1oinvd.b | ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵)) |
| Ref | Expression |
|---|---|
| fcof1oinvd | ⊢ (𝜑 → ◡𝐹 = 𝐺) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fcof1oinvd.b | . . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵)) | |
| 2 | 1 | coeq2d 5845 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵))) |
| 3 | coass 6281 | . . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺)) | |
| 4 | fcof1oinvd.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶1-1onto𝐵) | |
| 5 | f1ococnv1 6874 | . . . . . 6 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) |
| 7 | 6 | coeq1d 5844 | . . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺)) |
| 8 | fcof1oinvd.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) | |
| 9 | fcoi2 6776 | . . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) |
| 11 | 7, 10 | eqtrd 2798 | . . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺) |
| 12 | 3, 11 | eqtr3id 2812 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺) |
| 13 | f1ocnv 6856 | . . 3 ⊢ (𝐹:𝐴⟶1-1onto𝐵 → ◡𝐹:𝐵⟶1-1onto𝐴) | |
| 14 | f1of 6843 | . . 3 ⊢ (◡𝐹:𝐵⟶1-1onto𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 15 | fcoi1 6775 | . . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) | |
| 16 | 4, 13, 14, 15 | 4syl 20 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) |
| 17 | 2, 12, 16 | 3eqtr3rd 2807 | 1 ⊢ (𝜑 → ◡𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 I cid 5549 ◡ccnv 5654 ↾ cres 5657 ∘ ccom 5659 ⟶wf 6551 ⟶1-1ontowf1o 6554 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 |
| This theorem is used by: 2fcoidinvd 7323 |
| Copyright terms: Public domain | W3C validator |