Theorem 2fcoidinvd 7251

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 7250	. 2 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→𝐵)
6	5, 2, 4	fcof1oinvd 7249	1 ⊢ (𝜑 → ◡𝐹 = 𝐺)

Syntax hints:   → wi 4   = wceq 1542   I cid 5526  ^◡ccnv 5631   ↾ cres 5634   ∘ ccom 5636  ⟶wf 6496

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508

This theorem is referenced by:  fcof1o  7252  2fvidinvd  7255  pmtrfcnv  19405  qtophmeo  23773  fsovcnvd  44364