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

Theorem oprab2co 6392
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 4763 . . 3 ((𝐶𝑅𝐷𝑆) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
41, 2, 3syl2anc 411 . 2 ((𝑥𝐴𝑦𝐵) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
5 oprab2co.3 . 2 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨𝐶, 𝐷⟩)
6 oprab2co.4 . . 3 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷))
7 df-ov 6031 . . . . 5 (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩)
87a1i 9 . . . 4 ((𝑥𝐴𝑦𝐵) → (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩))
98mpoeq3ia 6096 . . 3 (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷)) = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
106, 9eqtri 2252 . 2 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
114, 5, 10oprabco 6391 1 (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  cop 3676   × cxp 4729  ccom 4735   Fn wfn 5328  cfv 5333  (class class class)co 6028  cmpo 6030
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator