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

Theorem offval3 6371
Description: General value of (𝐹 ∘𝑓 𝑅𝐺) with no assumptions on functionality of 𝐹 and 𝐺. (Contributed by Stefan O'Rear, 24-Jan-2015.)
Assertion
Ref Expression
offval3 ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
Distinct variable groups:   𝑥,𝐹   𝑥,𝐺   𝑥,𝑉   𝑥,𝑊   𝑥,𝑅

Proof of Theorem offval3
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 2833 . . 3 (𝐹 ∈ 𝑉 → 𝐹 ∈ V)
21adantr 276 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → 𝐹 ∈ V)
3 elex 2833 . . 3 (𝐺 ∈ 𝑊 → 𝐺 ∈ V)
43adantl 277 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → 𝐺 ∈ V)
5 dmexg 5048 . . . 4 (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V)
6 inex1g 4271 . . . 4 (dom 𝐹 ∈ V → (dom 𝐹 ∩ dom 𝐺) ∈ V)
7 mptexg 5945 . . . 4 ((dom 𝐹 ∩ dom 𝐺) ∈ V → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
85, 6, 73syl 17 . . 3 (𝐹 ∈ 𝑉 → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
98adantr 276 . 2 ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V)
10 dmeq 4983 . . . . 5 (𝑎 = 𝐹 → dom 𝑎 = dom 𝐹)
11 dmeq 4983 . . . . 5 (𝑏 = 𝐺 → dom 𝑏 = dom 𝐺)
1210, 11ineqan12d 3434 . . . 4 ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → (dom 𝑎 ∩ dom 𝑏) = (dom 𝐹 ∩ dom 𝐺))
13 fveq1 5697 . . . . 5 (𝑎 = 𝐹 → (𝑎‘𝑥) = (𝐹‘𝑥))
14 fveq1 5697 . . . . 5 (𝑏 = 𝐺 → (𝑏‘𝑥) = (𝐺‘𝑥))
1513, 14oveqan12d 6107 . . . 4 ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → ((𝑎‘𝑥)𝑅(𝑏‘𝑥)) = ((𝐹‘𝑥)𝑅(𝐺‘𝑥)))
1612, 15mpteq12dv 4214 . . 3 ((𝑎 = 𝐹 ∧ 𝑏 = 𝐺) → (𝑥 ∈ (dom 𝑎 ∩ dom 𝑏) ↦ ((𝑎‘𝑥)𝑅(𝑏‘𝑥))) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
17 df-of 6305 . . 3 ∘𝑓 𝑅 = (𝑎 ∈ V, 𝑏 ∈ V ↦ (𝑥 ∈ (dom 𝑎 ∩ dom 𝑏) ↦ ((𝑎‘𝑥)𝑅(𝑏‘𝑥))))
1816, 17ovmpoga 6221 . 2 ((𝐹 ∈ V ∧ 𝐺 ∈ V ∧ (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))) ∈ V) → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
192, 4, 9, 18syl3anc 1278 1 ((𝐹 ∈ 𝑉 ∧ 𝐺 ∈ 𝑊) → (𝐹 ∘𝑓 𝑅𝐺) = (𝑥 ∈ (dom 𝐹 ∩ dom 𝐺) ↦ ((𝐹‘𝑥)𝑅(𝐺‘𝑥))))
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 4193  dom cdm 4776  ‘cfv 5380  (class class class)co 6088   ∘𝑓 cof 6303
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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686
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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-of 6305
This theorem is used by:  offres  6372
  Copyright terms: Public domain W3C validator