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

Theorem offval 5744
 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 5409 . . . 4 ((𝐹 Fn 𝐴𝐴𝑉) → 𝐹 ∈ V)
41, 2, 3syl2anc 403 . . 3 (𝜑𝐹 ∈ V)
5 offval.2 . . . 4 (𝜑𝐺 Fn 𝐵)
6 offval.4 . . . 4 (𝜑𝐵𝑊)
7 fnex 5409 . . . 4 ((𝐺 Fn 𝐵𝐵𝑊) → 𝐺 ∈ V)
85, 6, 7syl2anc 403 . . 3 (𝜑𝐺 ∈ V)
9 fndm 5023 . . . . . . . 8 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
101, 9syl 14 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
11 fndm 5023 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
125, 11syl 14 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
1310, 12ineq12d 3169 . . . . . 6 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴𝐵))
14 offval.5 . . . . . 6 (𝐴𝐵) = 𝑆
1513, 14syl6eq 2130 . . . . 5 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
1615mpteq1d 3865 . . . 4 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) = (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
17 inex1g 3916 . . . . . 6 (𝐴𝑉 → (𝐴𝐵) ∈ V)
1814, 17syl5eqelr 2167 . . . . 5 (𝐴𝑉𝑆 ∈ V)
19 mptexg 5412 . . . . 5 (𝑆 ∈ V → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
202, 18, 193syl 17 . . . 4 (𝜑 → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
2116, 20eqeltrd 2156 . . 3 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
22 dmeq 4557 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
23 dmeq 4557 . . . . . 6 (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
2422, 23ineqan12d 3170 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
25 fveq1 5202 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
26 fveq1 5202 . . . . . 6 (𝑔 = 𝐺 → (𝑔𝑥) = (𝐺𝑥))
2725, 26oveqan12d 5556 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓𝑥)𝑅(𝑔𝑥)) = ((𝐹𝑥)𝑅(𝐺𝑥)))
2824, 27mpteq12dv 3862 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
29 df-of 5737 . . . 4 𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
3028, 29ovmpt2ga 5655 . . 3 ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V) → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
314, 8, 21, 30syl3anc 1170 . 2 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
3214eleq2i 2146 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ 𝑥𝑆)
33 elin 3156 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
3432, 33bitr3i 184 . . . 4 (𝑥𝑆 ↔ (𝑥𝐴𝑥𝐵))
35 offval.6 . . . . . 6 ((𝜑𝑥𝐴) → (𝐹𝑥) = 𝐶)
3635adantrr 463 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → (𝐹𝑥) = 𝐶)
37 offval.7 . . . . . 6 ((𝜑𝑥𝐵) → (𝐺𝑥) = 𝐷)
3837adantrl 462 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → (𝐺𝑥) = 𝐷)
3936, 38oveq12d 5555 . . . 4 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → ((𝐹𝑥)𝑅(𝐺𝑥)) = (𝐶𝑅𝐷))
4034, 39sylan2b 281 . . 3 ((𝜑𝑥𝑆) → ((𝐹𝑥)𝑅(𝐺𝑥)) = (𝐶𝑅𝐷))
4140mpteq2dva 3870 . 2 (𝜑 → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) = (𝑥𝑆 ↦ (𝐶𝑅𝐷)))
4231, 16, 413eqtrd 2118 1 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥𝑆 ↦ (𝐶𝑅𝐷)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 102   = wceq 1285   ∈ wcel 1434  Vcvv 2602   ∩ cin 2973   ↦ cmpt 3841  dom cdm 4365   Fn wfn 4921  ‘cfv 4926  (class class class)co 5537   ∘𝑓 cof 5735 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2064  ax-coll 3895  ax-sep 3898  ax-pow 3950  ax-pr 3966  ax-setind 4282 This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1687  df-eu 1945  df-mo 1946  df-clab 2069  df-cleq 2075  df-clel 2078  df-nfc 2209  df-ne 2247  df-ral 2354  df-rex 2355  df-reu 2356  df-rab 2358  df-v 2604  df-sbc 2817  df-csb 2910  df-dif 2976  df-un 2978  df-in 2980  df-ss 2987  df-pw 3386  df-sn 3406  df-pr 3407  df-op 3409  df-uni 3604  df-iun 3682  df-br 3788  df-opab 3842  df-mpt 3843  df-id 4050  df-xp 4371  df-rel 4372  df-cnv 4373  df-co 4374  df-dm 4375  df-rn 4376  df-res 4377  df-ima 4378  df-iota 4891  df-fun 4928  df-fn 4929  df-f 4930  df-f1 4931  df-fo 4932  df-f1o 4933  df-fv 4934  df-ov 5540  df-oprab 5541  df-mpt2 5542  df-of 5737 This theorem is referenced by:  fnofval  5746  off  5749  ofres  5750  offval2  5751  suppssof1  5753  ofco  5754  offveqb  5755
 Copyright terms: Public domain W3C validator