MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  2fvcoidd Structured version   Visualization version   GIF version

Theorem 2fvcoidd 6552
Description: Show that the composition of two functions is the identity function by applying both functions to each value of the domain of the first function. (Contributed by AV, 15-Dec-2019.)
Hypotheses
Ref Expression
2fvcoidd.f (𝜑𝐹:𝐴𝐵)
2fvcoidd.g (𝜑𝐺:𝐵𝐴)
2fvcoidd.i (𝜑 → ∀𝑎𝐴 (𝐺‘(𝐹𝑎)) = 𝑎)
Assertion
Ref Expression
2fvcoidd (𝜑 → (𝐺𝐹) = ( I ↾ 𝐴))
Distinct variable groups:   𝐴,𝑎   𝐹,𝑎   𝐺,𝑎
Allowed substitution hints:   𝜑(𝑎)   𝐵(𝑎)

Proof of Theorem 2fvcoidd
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 2fvcoidd.g . . 3 (𝜑𝐺:𝐵𝐴)
2 2fvcoidd.f . . 3 (𝜑𝐹:𝐴𝐵)
3 fcompt 6400 . . 3 ((𝐺:𝐵𝐴𝐹:𝐴𝐵) → (𝐺𝐹) = (𝑥𝐴 ↦ (𝐺‘(𝐹𝑥))))
41, 2, 3syl2anc 693 . 2 (𝜑 → (𝐺𝐹) = (𝑥𝐴 ↦ (𝐺‘(𝐹𝑥))))
5 2fvcoidd.i . . . . . 6 (𝜑 → ∀𝑎𝐴 (𝐺‘(𝐹𝑎)) = 𝑎)
6 fveq2 6191 . . . . . . . . 9 (𝑎 = 𝑥 → (𝐹𝑎) = (𝐹𝑥))
76fveq2d 6195 . . . . . . . 8 (𝑎 = 𝑥 → (𝐺‘(𝐹𝑎)) = (𝐺‘(𝐹𝑥)))
8 id 22 . . . . . . . 8 (𝑎 = 𝑥𝑎 = 𝑥)
97, 8eqeq12d 2637 . . . . . . 7 (𝑎 = 𝑥 → ((𝐺‘(𝐹𝑎)) = 𝑎 ↔ (𝐺‘(𝐹𝑥)) = 𝑥))
109rspccv 3306 . . . . . 6 (∀𝑎𝐴 (𝐺‘(𝐹𝑎)) = 𝑎 → (𝑥𝐴 → (𝐺‘(𝐹𝑥)) = 𝑥))
115, 10syl 17 . . . . 5 (𝜑 → (𝑥𝐴 → (𝐺‘(𝐹𝑥)) = 𝑥))
1211imp 445 . . . 4 ((𝜑𝑥𝐴) → (𝐺‘(𝐹𝑥)) = 𝑥)
1312mpteq2dva 4744 . . 3 (𝜑 → (𝑥𝐴 ↦ (𝐺‘(𝐹𝑥))) = (𝑥𝐴𝑥))
14 mptresid 5456 . . 3 (𝑥𝐴𝑥) = ( I ↾ 𝐴)
1513, 14syl6eq 2672 . 2 (𝜑 → (𝑥𝐴 ↦ (𝐺‘(𝐹𝑥))) = ( I ↾ 𝐴))
164, 15eqtrd 2656 1 (𝜑 → (𝐺𝐹) = ( I ↾ 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1483  wcel 1990  wral 2912  cmpt 4729   I cid 5023  cres 5116  ccom 5118  wf 5884  cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896
This theorem is referenced by:  2fvidf1od  6553  2fvidinvd  6554
  Copyright terms: Public domain W3C validator