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

Theorem offval 7691
Description: Value of an operation applied to two functions. (Contributed by Mario Carneiro, 20-Jul-2014.)
Hypotheses
Ref Expression
offval.1 (𝜑 → 𝐹 Fn 𝐴)
offval.2 (𝜑 → 𝐺 Fn 𝐵)
offval.3 (𝜑 → 𝐴 ∈ 𝑉)
offval.4 (𝜑 → 𝐵 ∈ 𝑊)
offval.5 (𝐴 ∩ 𝐵) = 𝑆
offval.6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
offval.7 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = 𝐷)
Assertion
Ref Expression
offval (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ (𝐶𝑅𝐷)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺   𝜑,𝑥   𝑥,𝑆   𝑥,𝑅
Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥)   𝐷(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem offval
Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 offval.1 . . . 4 (𝜑 → 𝐹 Fn 𝐴)
2 offval.3 . . . 4 (𝜑 → 𝐴 ∈ 𝑉)
3 fnex 7215 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V)
41, 2, 3syl2anc 596 . . 3 (𝜑 → 𝐹 ∈ V)
5 offval.2 . . . 4 (𝜑 → 𝐺 Fn 𝐵)
6 offval.4 . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
7 fnex 7215 . . . 4 ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊) → 𝐺 ∈ V)
85, 6, 7syl2anc 596 . . 3 (𝜑 → 𝐺 ∈ V)
91fndmd 6636 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
105fndmd 6636 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
119, 10ineq12d 4167 . . . . . 6 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴 ∩ 𝐵))
12 offval.5 . . . . . 6 (𝐴 ∩ 𝐵) = 𝑆
1311, 12eqtrdi 2812 . . . . 5 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
1413mpteq1d 5195 . . . 4 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
15 inex1g 5279 . . . . . 6 (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V)
1612, 15eqeltrrid 2866 . . . . 5 (𝐴 ∈ 𝑉 → 𝑆 ∈ V)
17 mptexg 7219 . . . . 5 (𝑆 ∈ V → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
182, 16, 173syl 19 . . . 4 (𝜑 → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
1914, 18eqeltrd 2861 . . 3 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
20 dmeq 5885 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
21 dmeq 5885 . . . . . 6 (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
2220, 21ineqan12d 4168 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
23 fveq1 6876 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
24 fveq1 6876 . . . . . 6 (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥))
2523, 24oveqan12d 7431 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)𝑅(𝑔‘𝑥)) = ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
2622, 25mpteq12dv 5192 . . . 4 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
27 df-of 7682 . . . 4 ∘f 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))))
2826, 27ovmpoga 7566 . . 3 ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
294, 8, 19, 28syl3anc 1398 . 2 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
3012eleq2i 2853 . . . . 5 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ 𝑥 ∈ 𝑆)
31 elin 3915 . . . . 5 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
3230, 31bitr3i 280 . . . 4 (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
33 offval.6 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
3433adantrr 730 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝐹‘𝑥) = 𝐶)
35 offval.7 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = 𝐷)
3635adantrl 729 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝐺‘𝑥) = 𝐷)
3734, 36oveq12d 7430 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝐶𝑅𝐷))
3832, 37sylan2b 606 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝐶𝑅𝐷))
3938mpteq2dva 5198 . 2 (𝜑 → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ (𝐶𝑅𝐷)))
4029, 14, 393eqtrd 2800 1 (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ (𝐶𝑅𝐷)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898   ↦ cmpt 5186  dom cdm 5651   Fn wfn 6526  ‘cfv 6531  (class class class)co 7412   ∘f cof 7680
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682
This theorem is used by:  ofval  7693  offn  7695  offval2f  7697  off  7700  ofres  7701  offval2  7702  coof  7706  ofco  7707  offveqb  7709  suppssof1  8200  o1rlimmul  15766  frlmipval  22065  frlmphllem  22066  frlmphl  22067  gsumbagdiaglem  22219  psrascl  22266  evlslem1  22371  evlsvvval  22382  mhpmulcl  22450  psdmplcl  22463  psdadd  22464  psdmul  22467  psrplusgpropd  22533  evls1fpws  22667  mat1dimscm  22770  matunitlindflem1  22974  matunitlindflem2  22975  rrxcph  25693  rrxds  25694  mbfadd  25962  mbfsub  25963  mbfmullem2  26025  mbfmul  26027  bddmulibl  26139  dvcmulf  26245  plymul02  26583  ofrn2  33216  off2  33217  ofresid  33218  islinds5  33905  ellspds  33906  ply1gsumz  34113  extdgfialglem2  34307  ofcof  34721  signsplypnf  35162  signsply0  35163  poimirlem4  38510  poimirlem16  38522  poimirlem19  38525  poimirlem28  38534  broucube  38540  itg2addnc  38560  ftc1anclem8  38586  dflinc2  49466  fdivmpt  49596  veroquadmodzerod  50928
  Copyright terms: Public domain W3C validator