Theorem 2fcoidinvd 7050

Description: Show that a function is the inverse of a function if their compositions are the identity functions. (Contributed by Mario Carneiro, 21-Mar-2015.) (Revised by AV, 15-Dec-2019.)

Hypotheses

Ref	Expression
fcof1od.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
fcof1od.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
fcof1od.a	⊢ (𝜑 → (𝐺 ∘ 𝐹) = ( I ↾ 𝐴))
fcof1od.b	⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵))

Assertion

Ref	Expression
2fcoidinvd	⊢ (𝜑 → ◡𝐹 = 𝐺)

Proof of Theorem 2fcoidinvd

Step	Hyp	Ref	Expression
1		fcof1od.f	. . 3 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
2		fcof1od.g	. . 3 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
3		fcof1od.a	. . 3 ⊢ (𝜑 → (𝐺 ∘ 𝐹) = ( I ↾ 𝐴))
4		fcof1od.b	. . 3 ⊢ (𝜑 → (𝐹 ∘ 𝐺) = ( I ↾ 𝐵))
5	1, 2, 3, 4	fcof1od 7049	. 2 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
6	5, 2, 4	fcof1oinvd 7048	1 ⊢ (𝜑 → ◡𝐹 = 𝐺)

Syntax hints:   → wi 4   = wceq 1533   I cid 5458  ^◡ccnv 5553   ↾ cres 5556   ∘ ccom 5558  ⟶wf 6350

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4838  df-br 5066  df-opab 5128  df-mpt 5146  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362

This theorem is referenced by:  fcof1o  7051  2fvidinvd  7054  pmtrfcnv  18591  qtophmeo  22424  fsovcnvd  40358