| 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 7304. (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 5839 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵))) |
| 3 | coass 6267 | . . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺)) | |
| 4 | fcof1oinvd.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵) | |
| 5 | f1ococnv1 6854 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) | |
| 6 | 4, 5 | syl 18 | . . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) |
| 7 | 6 | coeq1d 5838 | . . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺)) |
| 8 | fcof1oinvd.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) | |
| 9 | fcoi2 6757 | . . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) |
| 11 | 7, 10 | eqtrd 2795 | . . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺) |
| 12 | 3, 11 | eqtr3id 2809 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺) |
| 13 | f1ocnv 6837 | . . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
| 14 | f1of 6824 | . . 3 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
| 15 | fcoi1 6756 | . . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) | |
| 16 | 4, 13, 14, 15 | 4syl 20 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) |
| 17 | 2, 12, 16 | 3eqtr3rd 2804 | 1 ⊢ (𝜑 → ◡𝐹 = 𝐺) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 I cid 5544 ◡ccnv 5649 ↾ cres 5652 ∘ ccom 5654 ⟶wf 6534 –1-1-onto→wf1o 6537 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 |
| This theorem is used by: 2fcoidinvd 7303 |
| Copyright terms: Public domain | W3C validator |