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

Theorem offval 5982
 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 5635 . . . 4 ((𝐹 Fn 𝐴𝐴𝑉) → 𝐹 ∈ V)
41, 2, 3syl2anc 408 . . 3 (𝜑𝐹 ∈ V)
5 offval.2 . . . 4 (𝜑𝐺 Fn 𝐵)
6 offval.4 . . . 4 (𝜑𝐵𝑊)
7 fnex 5635 . . . 4 ((𝐺 Fn 𝐵𝐵𝑊) → 𝐺 ∈ V)
85, 6, 7syl2anc 408 . . 3 (𝜑𝐺 ∈ V)
9 fndm 5217 . . . . . . . 8 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
101, 9syl 14 . . . . . . 7 (𝜑 → dom 𝐹 = 𝐴)
11 fndm 5217 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
125, 11syl 14 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
1310, 12ineq12d 3273 . . . . . 6 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = (𝐴𝐵))
14 offval.5 . . . . . 6 (𝐴𝐵) = 𝑆
1513, 14syl6eq 2186 . . . . 5 (𝜑 → (dom 𝐹 ∩ dom 𝐺) = 𝑆)
1615mpteq1d 4008 . . . 4 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) = (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
17 inex1g 4059 . . . . . 6 (𝐴𝑉 → (𝐴𝐵) ∈ V)
1814, 17eqeltrrid 2225 . . . . 5 (𝐴𝑉𝑆 ∈ V)
19 mptexg 5638 . . . . 5 (𝑆 ∈ V → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
202, 18, 193syl 17 . . . 4 (𝜑 → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
2116, 20eqeltrd 2214 . . 3 (𝜑 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V)
22 dmeq 4734 . . . . . 6 (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
23 dmeq 4734 . . . . . 6 (𝑔 = 𝐺 → dom 𝑔 = dom 𝐺)
2422, 23ineqan12d 3274 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (dom 𝑓 ∩ dom 𝑔) = (dom 𝐹 ∩ dom 𝐺))
25 fveq1 5413 . . . . . 6 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
26 fveq1 5413 . . . . . 6 (𝑔 = 𝐺 → (𝑔𝑥) = (𝐺𝑥))
2725, 26oveqan12d 5786 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓𝑥)𝑅(𝑔𝑥)) = ((𝐹𝑥)𝑅(𝐺𝑥)))
2824, 27mpteq12dv 4005 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
29 df-of 5975 . . . 4 𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
3028, 29ovmpoga 5893 . . 3 ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) ∈ V) → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
314, 8, 21, 30syl3anc 1216 . 2 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹𝑥)𝑅(𝐺𝑥))))
3214eleq2i 2204 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ 𝑥𝑆)
33 elin 3254 . . . . 5 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
3432, 33bitr3i 185 . . . 4 (𝑥𝑆 ↔ (𝑥𝐴𝑥𝐵))
35 offval.6 . . . . . 6 ((𝜑𝑥𝐴) → (𝐹𝑥) = 𝐶)
3635adantrr 470 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → (𝐹𝑥) = 𝐶)
37 offval.7 . . . . . 6 ((𝜑𝑥𝐵) → (𝐺𝑥) = 𝐷)
3837adantrl 469 . . . . 5 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → (𝐺𝑥) = 𝐷)
3936, 38oveq12d 5785 . . . 4 ((𝜑 ∧ (𝑥𝐴𝑥𝐵)) → ((𝐹𝑥)𝑅(𝐺𝑥)) = (𝐶𝑅𝐷))
4034, 39sylan2b 285 . . 3 ((𝜑𝑥𝑆) → ((𝐹𝑥)𝑅(𝐺𝑥)) = (𝐶𝑅𝐷))
4140mpteq2dva 4013 . 2 (𝜑 → (𝑥𝑆 ↦ ((𝐹𝑥)𝑅(𝐺𝑥))) = (𝑥𝑆 ↦ (𝐶𝑅𝐷)))
4231, 16, 413eqtrd 2174 1 (𝜑 → (𝐹𝑓 𝑅𝐺) = (𝑥𝑆 ↦ (𝐶𝑅𝐷)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   = wceq 1331   ∈ wcel 1480  Vcvv 2681   ∩ cin 3065   ↦ cmpt 3984  dom cdm 4534   Fn wfn 5113  ‘cfv 5118  (class class class)co 5767   ∘𝑓 cof 5973 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-pow 4093  ax-pr 4126  ax-setind 4447 This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-of 5975 This theorem is referenced by:  ofvalg  5984  off  5987  ofres  5989  offval2  5990  suppssof1  5992  ofco  5993  offveqb  5994
 Copyright terms: Public domain W3C validator