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

Theorem ofres 6317
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 2239 . . 3 ((𝜑𝑥𝐴) → (𝐹𝑥) = (𝐹𝑥))
7 eqidd 2239 . . 3 ((𝜑𝑥𝐵) → (𝐺𝑥) = (𝐺𝑥))
81, 2, 3, 4, 5, 6, 7offval 6310 . 2 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
9 inss1 3451 . . . . 5 (𝐴𝐵) ⊆ 𝐴
105, 9eqsstrri 3281 . . . 4 𝐶𝐴
11 fnssres 5496 . . . 4 ((𝐹 Fn 𝐴𝐶𝐴) → (𝐹𝐶) Fn 𝐶)
121, 10, 11sylancl 417 . . 3 (𝜑 → (𝐹𝐶) Fn 𝐶)
13 inss2 3452 . . . . 5 (𝐴𝐵) ⊆ 𝐵
145, 13eqsstrri 3281 . . . 4 𝐶𝐵
15 fnssres 5496 . . . 4 ((𝐺 Fn 𝐵𝐶𝐵) → (𝐺𝐶) Fn 𝐶)
162, 14, 15sylancl 417 . . 3 (𝜑 → (𝐺𝐶) Fn 𝐶)
17 ssexg 4272 . . . 4 ((𝐶𝐴𝐴𝑉) → 𝐶 ∈ V)
1810, 3, 17sylancr 418 . . 3 (𝜑𝐶 ∈ V)
19 inidm 3440 . . 3 (𝐶𝐶) = 𝐶
20 fvres 5719 . . . 4 (𝑥𝐶 → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
2120adantl 277 . . 3 ((𝜑𝑥𝐶) → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
22 fvres 5719 . . . 4 (𝑥𝐶 → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2322adantl 277 . . 3 ((𝜑𝑥𝐶) → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2412, 16, 18, 18, 19, 21, 23offval 6310 . 2 (𝜑 → ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
258, 24eqtr4d 2274 1 (𝜑 → (𝐹𝑓 𝑅𝐺) = ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104   = wceq 1402  wcel 2209  Vcvv 2821  cin 3219  wss 3220  cmpt 4192  cres 4776   Fn wfn 5372  cfv 5377  (class class class)co 6085  𝑓 cof 6300
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-setind 4684
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator