Theorem fcof1oinvd 7165

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 7168. (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 5771	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵)))
3		coass 6169	. . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺))
4		fcof1oinvd.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
5		f1ococnv1 6745	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
6	4, 5	syl 17	. . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
7	6	coeq1d 5770	. . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺))
8		fcof1oinvd.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
9		fcoi2 6649	. . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
11	7, 10	eqtrd 2778	. . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺)
12	3, 11	eqtr3id 2792	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺)
13		f1ocnv 6728	. . . . 5 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
14	4, 13	syl 17	. . . 4 ⊢ (𝜑 → ◡𝐹:𝐵–1-1-onto→𝐴)
15		f1of 6716	. . . 4 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴)
16	14, 15	syl 17	. . 3 ⊢ (𝜑 → ◡𝐹:𝐵⟶𝐴)
17		fcoi1 6648	. . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
18	16, 17	syl 17	. 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
19	2, 12, 18	3eqtr3rd 2787	1 ⊢ (𝜑 → ◡𝐹 = 𝐺)

Syntax hints:   → wi 4   = wceq 1539   I cid 5488  ^◡ccnv 5588   ↾ cres 5591   ∘ ccom 5593  ⟶wf 6429  –1-1-onto→wf1o 6432

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440

This theorem is referenced by:  2fcoidinvd  7167