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

Theorem ofres 7148
Description: Restrict the operands of a function operation to the same domain as that of the operation itself. (Contributed by Mario Carneiro, 15-Sep-2014.)
Hypotheses
Ref Expression
ofres.1 (𝜑𝐹 Fn 𝐴)
ofres.2 (𝜑𝐺 Fn 𝐵)
ofres.3 (𝜑𝐴𝑉)
ofres.4 (𝜑𝐵𝑊)
ofres.5 (𝐴𝐵) = 𝐶
Assertion
Ref Expression
ofres (𝜑 → (𝐹𝑓 𝑅𝐺) = ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)))

Proof of Theorem ofres
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ofres.1 . . 3 (𝜑𝐹 Fn 𝐴)
2 ofres.2 . . 3 (𝜑𝐺 Fn 𝐵)
3 ofres.3 . . 3 (𝜑𝐴𝑉)
4 ofres.4 . . 3 (𝜑𝐵𝑊)
5 ofres.5 . . 3 (𝐴𝐵) = 𝐶
6 eqidd 2801 . . 3 ((𝜑𝑥𝐴) → (𝐹𝑥) = (𝐹𝑥))
7 eqidd 2801 . . 3 ((𝜑𝑥𝐵) → (𝐺𝑥) = (𝐺𝑥))
81, 2, 3, 4, 5, 6, 7offval 7139 . 2 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
9 inss1 4029 . . . . 5 (𝐴𝐵) ⊆ 𝐴
105, 9eqsstr3i 3833 . . . 4 𝐶𝐴
11 fnssres 6216 . . . 4 ((𝐹 Fn 𝐴𝐶𝐴) → (𝐹𝐶) Fn 𝐶)
121, 10, 11sylancl 581 . . 3 (𝜑 → (𝐹𝐶) Fn 𝐶)
13 inss2 4030 . . . . 5 (𝐴𝐵) ⊆ 𝐵
145, 13eqsstr3i 3833 . . . 4 𝐶𝐵
15 fnssres 6216 . . . 4 ((𝐺 Fn 𝐵𝐶𝐵) → (𝐺𝐶) Fn 𝐶)
162, 14, 15sylancl 581 . . 3 (𝜑 → (𝐺𝐶) Fn 𝐶)
17 ssexg 5000 . . . 4 ((𝐶𝐴𝐴𝑉) → 𝐶 ∈ V)
1810, 3, 17sylancr 582 . . 3 (𝜑𝐶 ∈ V)
19 inidm 4019 . . 3 (𝐶𝐶) = 𝐶
20 fvres 6431 . . . 4 (𝑥𝐶 → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
2120adantl 474 . . 3 ((𝜑𝑥𝐶) → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
22 fvres 6431 . . . 4 (𝑥𝐶 → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2322adantl 474 . . 3 ((𝜑𝑥𝐶) → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2412, 16, 18, 18, 19, 21, 23offval 7139 . 2 (𝜑 → ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
258, 24eqtr4d 2837 1 (𝜑 → (𝐹𝑓 𝑅𝐺) = ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 385   = wceq 1653  wcel 2157  Vcvv 3386  cin 3769  wss 3770  cmpt 4923  cres 5315   Fn wfn 6097  cfv 6102  (class class class)co 6879  𝑓 cof 7130
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2378  ax-ext 2778  ax-rep 4965  ax-sep 4976  ax-nul 4984  ax-pr 5098
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-mo 2592  df-eu 2610  df-clab 2787  df-cleq 2793  df-clel 2796  df-nfc 2931  df-ne 2973  df-ral 3095  df-rex 3096  df-reu 3097  df-rab 3099  df-v 3388  df-sbc 3635  df-csb 3730  df-dif 3773  df-un 3775  df-in 3777  df-ss 3784  df-nul 4117  df-if 4279  df-sn 4370  df-pr 4372  df-op 4376  df-uni 4630  df-iun 4713  df-br 4845  df-opab 4907  df-mpt 4924  df-id 5221  df-xp 5319  df-rel 5320  df-cnv 5321  df-co 5322  df-dm 5323  df-rn 5324  df-res 5325  df-ima 5326  df-iota 6065  df-fun 6104  df-fn 6105  df-f 6106  df-f1 6107  df-fo 6108  df-f1o 6109  df-fv 6110  df-ov 6882  df-oprab 6883  df-mpt2 6884  df-of 7132
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator