Theorem fcof1oinvd 7145

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 7148. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by AV, 15-Dec-2019.)

Hypotheses

Ref	Expression
fcof1oinvd.f	⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
fcof1oinvd.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
fcof1oinvd.b	⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵))

Assertion

Ref	Expression
fcof1oinvd	⊢ (𝜑 → ◡𝐹 = 𝐺)

Proof of Theorem fcof1oinvd

Step	Hyp	Ref	Expression
1		fcof1oinvd.b	. . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵))
2	1	coeq2d 5760	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵)))
3		coass 6158	. . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺))
4		fcof1oinvd.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
5		f1ococnv1 6728	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
6	4, 5	syl 17	. . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
7	6	coeq1d 5759	. . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺))
8		fcof1oinvd.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
9		fcoi2 6633	. . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
11	7, 10	eqtrd 2778	. . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺)
12	3, 11	eqtr3id 2793	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺)
13		f1ocnv 6712	. . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
14	4, 13	syl 17	. . . 4 ⊢ (𝜑 → ◡𝐹:𝐵–1-1-onto→𝐴)
15		f1of 6700	. . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴)
16	14, 15	syl 17	. . 3 ⊢ (𝜑 → ◡𝐹:𝐵⟶𝐴)
17		fcoi1 6632	. . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
18	16, 17	syl 17	. 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
19	2, 12, 18	3eqtr3rd 2787	1 ⊢ (𝜑 → ◡𝐹 = 𝐺)

Syntax hints:   → wi 4   = wceq 1539   I cid 5479  ^◡ccnv 5579   ↾ cres 5582   ∘ ccom 5584  ⟶wf 6414  –1-1-onto→wf1o 6417

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425

This theorem is referenced by:  2fcoidinvd  7147