![]() |
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 7311. (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 5869 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵))) |
3 | coass 6274 | . . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺)) | |
4 | fcof1oinvd.f | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵) | |
5 | f1ococnv1 6873 | . . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) | |
6 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴)) |
7 | 6 | coeq1d 5868 | . . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺)) |
8 | fcof1oinvd.g | . . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴) | |
9 | fcoi2 6777 | . . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) | |
10 | 8, 9 | syl 17 | . . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺) |
11 | 7, 10 | eqtrd 2768 | . . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺) |
12 | 3, 11 | eqtr3id 2782 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺) |
13 | f1ocnv 6856 | . . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴) | |
14 | 4, 13 | syl 17 | . . . 4 ⊢ (𝜑 → ◡𝐹:𝐵–1-1-onto→𝐴) |
15 | f1of 6844 | . . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴) | |
16 | 14, 15 | syl 17 | . . 3 ⊢ (𝜑 → ◡𝐹:𝐵⟶𝐴) |
17 | fcoi1 6776 | . . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) | |
18 | 16, 17 | syl 17 | . 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹) |
19 | 2, 12, 18 | 3eqtr3rd 2777 | 1 ⊢ (𝜑 → ◡𝐹 = 𝐺) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 I cid 5579 ◡ccnv 5681 ↾ cres 5684 ∘ ccom 5686 ⟶wf 6549 –1-1-onto→wf1o 6552 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-ral 3059 df-rex 3068 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-br 5153 df-opab 5215 df-id 5580 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 |
This theorem is referenced by: 2fcoidinvd 7310 |
Copyright terms: Public domain | W3C validator |