Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  afv2co2 Structured version   Visualization version   GIF version

Theorem afv2co2 48600
Description: Value of a function composition, analogous to fvco2 7013. (Contributed by AV, 8-Sep-2022.)
Assertion
Ref Expression
afv2co2 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → ((𝐹 ∘ 𝐺)''''𝑋) = (𝐹''''(𝐺''''𝑋)))

Proof of Theorem afv2co2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 imaco 6271 . . . . 5 ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ (𝐺 “ {𝑋}))
2 dfatsnafv2 48595 . . . . . . 7 (𝐺 defAt 𝑋 → {(𝐺''''𝑋)} = (𝐺 “ {𝑋}))
32adantr 486 . . . . . 6 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → {(𝐺''''𝑋)} = (𝐺 “ {𝑋}))
43imaeq2d 6070 . . . . 5 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → (𝐹 “ {(𝐺''''𝑋)}) = (𝐹 “ (𝐺 “ {𝑋})))
51, 4eqtr4id 2817 . . . 4 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → ((𝐹 ∘ 𝐺) “ {𝑋}) = (𝐹 “ {(𝐺''''𝑋)}))
65eleq2d 2850 . . 3 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → (𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋}) ↔ 𝑥 ∈ (𝐹 “ {(𝐺''''𝑋)})))
76iotabidv 6549 . 2 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺''''𝑋)})))
8 dfatco 48599 . . 3 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → (𝐹 ∘ 𝐺) defAt 𝑋)
9 dfafv23 48596 . . 3 ((𝐹 ∘ 𝐺) defAt 𝑋 → ((𝐹 ∘ 𝐺)''''𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})))
108, 9syl 18 . 2 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → ((𝐹 ∘ 𝐺)''''𝑋) = (℩𝑥𝑥 ∈ ((𝐹 ∘ 𝐺) “ {𝑋})))
11 dfafv23 48596 . . 3 (𝐹 defAt (𝐺''''𝑋) → (𝐹''''(𝐺''''𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺''''𝑋)})))
1211adantl 487 . 2 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → (𝐹''''(𝐺''''𝑋)) = (℩𝑥𝑥 ∈ (𝐹 “ {(𝐺''''𝑋)})))
137, 10, 123eqtr4d 2808 1 ((𝐺 defAt 𝑋 ∧ 𝐹 defAt (𝐺''''𝑋)) → ((𝐹 ∘ 𝐺)''''𝑋) = (𝐹''''(𝐺''''𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {csn 4588   “ cima 5661   ∘ ccom 5662  ℩cio 6518   defAt wdfat 48460  ''''cafv2 48551
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-dfat 48463  df-afv2 48552
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator