ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fvco2 GIF version

Theorem fvco2 5647
Description: Value of a function composition. Similar to second part of Theorem 3H of [Enderton] p. 47. (Contributed by NM, 9-Oct-2004.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Revised by Stefan O'Rear, 16-Oct-2014.)
Assertion
Ref Expression
fvco2 ((𝐺 Fn 𝐴𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))

Proof of Theorem fvco2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 imaco 5187 . . . . 5 ((𝐹𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋}))
2 fnsnfv 5637 . . . . . 6 ((𝐺 Fn 𝐴𝑋𝐴) → {(𝐺𝑋)} = (𝐺 “ {𝑋}))
32imaeq2d 5021 . . . . 5 ((𝐺 Fn 𝐴𝑋𝐴) → (𝐹 “ {(𝐺𝑋)}) = (𝐹 “ (𝐺 “ {𝑋})))
41, 3eqtr4id 2256 . . . 4 ((𝐺 Fn 𝐴𝑋𝐴) → ((𝐹𝐺) “ {𝑋}) = (𝐹 “ {(𝐺𝑋)}))
54eleq2d 2274 . . 3 ((𝐺 Fn 𝐴𝑋𝐴) → (𝑥 ∈ ((𝐹𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺𝑋)})))
65iotabidv 5253 . 2 ((𝐺 Fn 𝐴𝑋𝐴) → (℩𝑥𝑥 ∈ ((𝐹𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺𝑋)})))
7 dffv3g 5571 . . 3 (𝑋𝐴 → ((𝐹𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹𝐺) “ {𝑋})))
87adantl 277 . 2 ((𝐺 Fn 𝐴𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (℩𝑥𝑥 ∈ ((𝐹𝐺) “ {𝑋})))
9 funfvex 5592 . . . 4 ((Fun 𝐺𝑋 ∈ dom 𝐺) → (𝐺𝑋) ∈ V)
109funfni 5375 . . 3 ((𝐺 Fn 𝐴𝑋𝐴) → (𝐺𝑋) ∈ V)
11 dffv3g 5571 . . 3 ((𝐺𝑋) ∈ V → (𝐹‘(𝐺𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺𝑋)})))
1210, 11syl 14 . 2 ((𝐺 Fn 𝐴𝑋𝐴) → (𝐹‘(𝐺𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺𝑋)})))
136, 8, 123eqtr4d 2247 1 ((𝐺 Fn 𝐴𝑋𝐴) → ((𝐹𝐺)‘𝑋) = (𝐹‘(𝐺𝑋)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1372  wcel 2175  Vcvv 2771  {csn 3632  cima 4677  ccom 4678  cio 5229   Fn wfn 5265  cfv 5270
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-pow 4217  ax-pr 4252
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1375  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ral 2488  df-rex 2489  df-v 2773  df-sbc 2998  df-un 3169  df-in 3171  df-ss 3178  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-br 4044  df-opab 4105  df-id 4339  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-fv 5278
This theorem is referenced by:  fvco  5648  fvco3  5649  ofco  6176  updjudhcoinlf  7181  updjudhcoinrg  7182  updjud  7183  caseinl  7192  caseinr  7193  ctm  7210  enomnilem  7239  enmkvlem  7262  enwomnilem  7270  nninfctlemfo  12303  prdsidlem  13221  gsumwmhm  13272  prdsinvlem  13382  ringidvalg  13665  lidlvalg  14175  rspvalg  14176
  Copyright terms: Public domain W3C validator