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

Theorem oprab2co 6382
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 4757 . . 3 ((𝐶𝑅𝐷𝑆) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
41, 2, 3syl2anc 411 . 2 ((𝑥𝐴𝑦𝐵) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
5 oprab2co.3 . 2 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨𝐶, 𝐷⟩)
6 oprab2co.4 . . 3 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷))
7 df-ov 6020 . . . . 5 (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩)
87a1i 9 . . . 4 ((𝑥𝐴𝑦𝐵) → (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩))
98mpoeq3ia 6085 . . 3 (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷)) = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
106, 9eqtri 2252 . 2 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
114, 5, 10oprabco 6381 1 (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  cop 3672   × cxp 4723  ccom 4729   Fn wfn 5321  cfv 5326  (class class class)co 6017  cmpo 6019
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator