Theorem fcof1oinvd 7279

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 7282. (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 5836	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = (◡𝐹 ∘ ( I ↾ 𝐵)))
3		coass 6255	. . 3 ⊢ ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (◡𝐹 ∘ (𝐹 ∘ 𝐺))
4		fcof1oinvd.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
5		f1ococnv1 6838	. . . . . 6 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
6	4, 5	syl 17	. . . . 5 ⊢ (𝜑 → (◡𝐹 ∘ 𝐹) = ( I ↾ 𝐴))
7	6	coeq1d 5835	. . . 4 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = (( I ↾ 𝐴) ∘ 𝐺))
8		fcof1oinvd.g	. . . . 5 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
9		fcoi2 6741	. . . . 5 ⊢ (𝐺:𝐵⟶𝐴 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
10	8, 9	syl 17	. . . 4 ⊢ (𝜑 → (( I ↾ 𝐴) ∘ 𝐺) = 𝐺)
11	7, 10	eqtrd 2799	. . 3 ⊢ (𝜑 → ((◡𝐹 ∘ 𝐹) ∘ 𝐺) = 𝐺)
12	3, 11	eqtr3id 2813	. 2 ⊢ (𝜑 → (◡𝐹 ∘ (𝐹 ∘ 𝐺)) = 𝐺)
13		f1ocnv 6821	. . 3 ⊢ (𝐹:𝐴–1-1-onto→𝐵 → ◡𝐹:𝐵–1-1-onto→𝐴)
14		f1of 6808	. . 3 ⊢ (◡𝐹:𝐵–1-1-onto→𝐴 → ◡𝐹:𝐵⟶𝐴)
15		fcoi1 6740	. . 3 ⊢ (◡𝐹:𝐵⟶𝐴 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
16	4, 13, 14, 15	4syl 19	. 2 ⊢ (𝜑 → (◡𝐹 ∘ ( I ↾ 𝐵)) = ◡𝐹)
17	2, 12, 16	3eqtr3rd 2808	1 ⊢ (𝜑 → ◡𝐹 = 𝐺)

Syntax hints:   → wi 4   = wceq 1562   I cid 5543  ^◡ccnv 5648   ↾ cres 5651   ∘ ccom 5653  ⟶wf 6519  –1-1-onto→wf1o 6522

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-pr 5392

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530

This theorem is referenced by:  2fcoidinvd  7281