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

Theorem ofres 5947
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 2114 . . 3 ((𝜑𝑥𝐴) → (𝐹𝑥) = (𝐹𝑥))
7 eqidd 2114 . . 3 ((𝜑𝑥𝐵) → (𝐺𝑥) = (𝐺𝑥))
81, 2, 3, 4, 5, 6, 7offval 5941 . 2 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
9 inss1 3260 . . . . 5 (𝐴𝐵) ⊆ 𝐴
105, 9eqsstrri 3094 . . . 4 𝐶𝐴
11 fnssres 5192 . . . 4 ((𝐹 Fn 𝐴𝐶𝐴) → (𝐹𝐶) Fn 𝐶)
121, 10, 11sylancl 407 . . 3 (𝜑 → (𝐹𝐶) Fn 𝐶)
13 inss2 3261 . . . . 5 (𝐴𝐵) ⊆ 𝐵
145, 13eqsstrri 3094 . . . 4 𝐶𝐵
15 fnssres 5192 . . . 4 ((𝐺 Fn 𝐵𝐶𝐵) → (𝐺𝐶) Fn 𝐶)
162, 14, 15sylancl 407 . . 3 (𝜑 → (𝐺𝐶) Fn 𝐶)
17 ssexg 4025 . . . 4 ((𝐶𝐴𝐴𝑉) → 𝐶 ∈ V)
1810, 3, 17sylancr 408 . . 3 (𝜑𝐶 ∈ V)
19 inidm 3249 . . 3 (𝐶𝐶) = 𝐶
20 fvres 5397 . . . 4 (𝑥𝐶 → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
2120adantl 273 . . 3 ((𝜑𝑥𝐶) → ((𝐹𝐶)‘𝑥) = (𝐹𝑥))
22 fvres 5397 . . . 4 (𝑥𝐶 → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2322adantl 273 . . 3 ((𝜑𝑥𝐶) → ((𝐺𝐶)‘𝑥) = (𝐺𝑥))
2412, 16, 18, 18, 19, 21, 23offval 5941 . 2 (𝜑 → ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)) = (𝑥𝐶 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
258, 24eqtr4d 2148 1 (𝜑 → (𝐹𝑓 𝑅𝐺) = ((𝐹𝐶) ∘𝑓 𝑅(𝐺𝐶)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1312  wcel 1461  Vcvv 2655  cin 3034  wss 3035  cmpt 3947  cres 4499   Fn wfn 5074  cfv 5079  (class class class)co 5726  𝑓 cof 5932
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 586  ax-in2 587  ax-io 681  ax-5 1404  ax-7 1405  ax-gen 1406  ax-ie1 1450  ax-ie2 1451  ax-8 1463  ax-10 1464  ax-11 1465  ax-i12 1466  ax-bndl 1467  ax-4 1468  ax-14 1473  ax-17 1487  ax-i9 1491  ax-ial 1495  ax-i5r 1496  ax-ext 2095  ax-coll 4001  ax-sep 4004  ax-pow 4056  ax-pr 4089  ax-setind 4410
This theorem depends on definitions:  df-bi 116  df-3an 945  df-tru 1315  df-fal 1318  df-nf 1418  df-sb 1717  df-eu 1976  df-mo 1977  df-clab 2100  df-cleq 2106  df-clel 2109  df-nfc 2242  df-ne 2281  df-ral 2393  df-rex 2394  df-reu 2395  df-rab 2397  df-v 2657  df-sbc 2877  df-csb 2970  df-dif 3037  df-un 3039  df-in 3041  df-ss 3048  df-pw 3476  df-sn 3497  df-pr 3498  df-op 3500  df-uni 3701  df-iun 3779  df-br 3894  df-opab 3948  df-mpt 3949  df-id 4173  df-xp 4503  df-rel 4504  df-cnv 4505  df-co 4506  df-dm 4507  df-rn 4508  df-res 4509  df-ima 4510  df-iota 5044  df-fun 5081  df-fn 5082  df-f 5083  df-f1 5084  df-fo 5085  df-f1o 5086  df-fv 5087  df-ov 5729  df-oprab 5730  df-mpo 5731  df-of 5934
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator