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

Theorem offval 6310
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 (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ 𝑆 ↦ (𝐶𝑅𝐷)))
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 5937 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝐹 ∈ V)
41, 2, 3syl2anc 415 . . 3 (𝜑 → 𝐹 ∈ V)
5 offval.2 . . . 4 (𝜑 → 𝐺 Fn 𝐵)
6 offval.4 . . . 4 (𝜑 → 𝐵 ∈ 𝑊)
7 fnex 5937 . . . 4 ((𝐺 Fn 𝐵 ∧ 𝐵 ∈ 𝑊) → 𝐺 ∈ V)
85, 6, 7syl2anc 415 . . 3 (𝜑 → 𝐺 ∈ V)
9 fndm 5480 . . . . . . . 8 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
101, 9syl 14 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
11 fndm 5480 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
125, 11syl 14 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
1310, 12ineq12d 3433 . . . . . 6 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴 ∩ 𝐵))
14 offval.5 . . . . . 6 (𝐴 ∩ 𝐵) = 𝑆
1513, 14eqtrdi 2287 . . . . 5 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
1615mpteq1d 4216 . . . 4 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
17 inex1g 4269 . . . . . 6 (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V)
1814, 17eqeltrrid 2326 . . . . 5 (𝐴 ∈ 𝑉 → 𝑆 ∈ V)
19 mptexg 5942 . . . . 5 (𝑆 ∈ V → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
202, 18, 193syl 17 . . . 4 (𝜑 → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
2116, 20eqeltrd 2315 . . 3 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
22 dmeq 4981 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
23 dmeq 4981 . . . . . 6 (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
2422, 23ineqan12d 3434 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
25 fveq1 5694 . . . . . 6 (𝑓 = 𝐹 → (𝑓‘𝑥) = (𝐹‘𝑥))
26 fveq1 5694 . . . . . 6 (𝑔 = 𝐺 → (𝑔‘𝑥) = (𝐺‘𝑥))
2725, 26oveqan12d 6104 . . . . 5 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → ((𝑓‘𝑥)𝑅(𝑔‘𝑥)) = ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
2824, 27mpteq12dv 4213 . . . 4 ((𝑓 = 𝐹 ∧ 𝑔 = 𝐺) → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
29 df-of 6302 . . . 4 ∘𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓‘𝑥)𝑅(𝑔‘𝑥))))
3028, 29ovmpoga 6218 . . 3 ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
314, 8, 21, 30syl3anc 1278 . 2 (𝜑 → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
3214eleq2i 2305 . . . . 5 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ 𝑥 ∈ 𝑆)
33 elin 3412 . . . . 5 (𝑥 ∈ (𝐴 ∩ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
3432, 33bitr3i 186 . . . 4 (𝑥 ∈ 𝑆 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
35 offval.6 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
3635adantrr 483 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝐹‘𝑥) = 𝐶)
37 offval.7 . . . . . 6 ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = 𝐷)
3837adantrl 482 . . . . 5 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → (𝐺‘𝑥) = 𝐷)
3936, 38oveq12d 6103 . . . 4 ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵)) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝐶𝑅𝐷))
4034, 39sylan2b 287 . . 3 ((𝜑 ∧ 𝑥 ∈ 𝑆) → ((𝐹‘𝑥)𝑅(𝐺‘𝑥)) = (𝐶𝑅𝐷))
4140mpteq2dva 4221 . 2 (𝜑 → (𝑥 ∈ 𝑆 ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) = (𝑥 ∈ 𝑆 ↦ (𝐶𝑅𝐷)))
4231, 16, 413eqtrd 2275 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   ↦ cmpt 4192  dom cdm 4774   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:  ofvalg  6312  off  6315  ofres  6317  offval2  6318  suppssof1  6320  ofco  6321  offveqb  6322
  Copyright terms: Public domain W3C validator