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

Theorem oprab2co 6177
Description: Composition of operator abstractions. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by David Abernethy, 23-Apr-2013.)
Hypotheses
Ref Expression
oprab2co.1 ((𝑥𝐴𝑦𝐵) → 𝐶𝑅)
oprab2co.2 ((𝑥𝐴𝑦𝐵) → 𝐷𝑆)
oprab2co.3 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨𝐶, 𝐷⟩)
oprab2co.4 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷))
Assertion
Ref Expression
oprab2co (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑀,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)   𝐷(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem oprab2co
StepHypRef Expression
1 oprab2co.1 . . 3 ((𝑥𝐴𝑦𝐵) → 𝐶𝑅)
2 oprab2co.2 . . 3 ((𝑥𝐴𝑦𝐵) → 𝐷𝑆)
3 opelxpi 4630 . . 3 ((𝐶𝑅𝐷𝑆) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
41, 2, 3syl2anc 409 . 2 ((𝑥𝐴𝑦𝐵) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
5 oprab2co.3 . 2 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨𝐶, 𝐷⟩)
6 oprab2co.4 . . 3 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷))
7 df-ov 5839 . . . . 5 (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩)
87a1i 9 . . . 4 ((𝑥𝐴𝑦𝐵) → (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩))
98mpoeq3ia 5898 . . 3 (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷)) = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
106, 9eqtri 2185 . 2 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
114, 5, 10oprabco 6176 1 (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1342  wcel 2135  cop 3573   × cxp 4596  ccom 4602   Fn wfn 5177  cfv 5182  (class class class)co 5836  cmpo 5838
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-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-pow 4147  ax-pr 4181  ax-un 4405
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ral 2447  df-rex 2448  df-rab 2451  df-v 2723  df-sbc 2947  df-csb 3041  df-un 3115  df-in 3117  df-ss 3124  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-iun 3862  df-br 3977  df-opab 4038  df-mpt 4039  df-id 4265  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-fv 5190  df-ov 5839  df-oprab 5840  df-mpo 5841  df-1st 6100  df-2nd 6101
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator