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

Theorem ofmres 5783
Description: Equivalent expressions for a restriction of the function operation map. Unlike 𝑓 𝑅 which is a proper class, ( ∘𝑓 𝑅 ∣ ‘(𝐴 × 𝐵)) can be a set by ofmresex 5784, allowing it to be used as a function or structure argument. By ofmresval 5743, the restricted operation map values are the same as the original values, allowing theorems for 𝑓 𝑅 to be reused. (Contributed by NM, 20-Oct-2014.)
Assertion
Ref Expression
ofmres ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓𝐴, 𝑔𝐵 ↦ (𝑓𝑓 𝑅𝑔))
Distinct variable groups:   𝑓,𝑔,𝐴   𝐵,𝑓,𝑔   𝑅,𝑓,𝑔

Proof of Theorem ofmres
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssv 3019 . . 3 𝐴 ⊆ V
2 ssv 3019 . . 3 𝐵 ⊆ V
3 resmpt2 5619 . . 3 ((𝐴 ⊆ V ∧ 𝐵 ⊆ V) → ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓𝐴, 𝑔𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥)))))
41, 2, 3mp2an 416 . 2 ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥)))) ↾ (𝐴 × 𝐵)) = (𝑓𝐴, 𝑔𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
5 df-of 5732 . . 3 𝑓 𝑅 = (𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
65reseq1i 4626 . 2 ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = ((𝑓 ∈ V, 𝑔 ∈ V ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥)))) ↾ (𝐴 × 𝐵))
7 eqid 2081 . . 3 𝐴 = 𝐴
8 eqid 2081 . . 3 𝐵 = 𝐵
9 vex 2604 . . . 4 𝑓 ∈ V
10 vex 2604 . . . 4 𝑔 ∈ V
119dmex 4616 . . . . . 6 dom 𝑓 ∈ V
1211inex1 3912 . . . . 5 (dom 𝑓 ∩ dom 𝑔) ∈ V
1312mptex 5408 . . . 4 (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))) ∈ V
145ovmpt4g 5643 . . . 4 ((𝑓 ∈ V ∧ 𝑔 ∈ V ∧ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))) ∈ V) → (𝑓𝑓 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
159, 10, 13, 14mp3an 1268 . . 3 (𝑓𝑓 𝑅𝑔) = (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥)))
167, 8, 15mpt2eq123i 5588 . 2 (𝑓𝐴, 𝑔𝐵 ↦ (𝑓𝑓 𝑅𝑔)) = (𝑓𝐴, 𝑔𝐵 ↦ (𝑥 ∈ (dom 𝑓 ∩ dom 𝑔) ↦ ((𝑓𝑥)𝑅(𝑔𝑥))))
174, 6, 163eqtr4i 2111 1 ( ∘𝑓 𝑅 ↾ (𝐴 × 𝐵)) = (𝑓𝐴, 𝑔𝐵 ↦ (𝑓𝑓 𝑅𝑔))
Colors of variables: wff set class
Syntax hints:   = wceq 1284  wcel 1433  Vcvv 2601  cin 2972  wss 2973  cmpt 3839   × cxp 4361  dom cdm 4363  cres 4365  cfv 4922  (class class class)co 5532  cmpt2 5534  𝑓 cof 5730
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 576  ax-in2 577  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-13 1444  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-coll 3893  ax-sep 3896  ax-pow 3948  ax-pr 3964  ax-un 4188  ax-setind 4280
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-fal 1290  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ne 2246  df-ral 2353  df-rex 2354  df-reu 2355  df-rab 2357  df-v 2603  df-sbc 2816  df-csb 2909  df-dif 2975  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-iun 3680  df-br 3786  df-opab 3840  df-mpt 3841  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537  df-of 5732
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator