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

Theorem oprab2co 6122
 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 4578 . . 3 ((𝐶𝑅𝐷𝑆) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
41, 2, 3syl2anc 409 . 2 ((𝑥𝐴𝑦𝐵) → ⟨𝐶, 𝐷⟩ ∈ (𝑅 × 𝑆))
5 oprab2co.3 . 2 𝐹 = (𝑥𝐴, 𝑦𝐵 ↦ ⟨𝐶, 𝐷⟩)
6 oprab2co.4 . . 3 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷))
7 df-ov 5784 . . . . 5 (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩)
87a1i 9 . . . 4 ((𝑥𝐴𝑦𝐵) → (𝐶𝑀𝐷) = (𝑀‘⟨𝐶, 𝐷⟩))
98mpoeq3ia 5843 . . 3 (𝑥𝐴, 𝑦𝐵 ↦ (𝐶𝑀𝐷)) = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
106, 9eqtri 2161 . 2 𝐺 = (𝑥𝐴, 𝑦𝐵 ↦ (𝑀‘⟨𝐶, 𝐷⟩))
114, 5, 10oprabco 6121 1 (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀𝐹))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   = wceq 1332   ∈ wcel 1481  ⟨cop 3534   × cxp 4544   ∘ ccom 4550   Fn wfn 5125  ‘cfv 5130  (class class class)co 5781   ∈ cmpo 5783 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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4053  ax-pow 4105  ax-pr 4138  ax-un 4362 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2913  df-csb 3007  df-un 3079  df-in 3081  df-ss 3088  df-pw 3516  df-sn 3537  df-pr 3538  df-op 3540  df-uni 3744  df-iun 3822  df-br 3937  df-opab 3997  df-mpt 3998  df-id 4222  df-xp 4552  df-rel 4553  df-cnv 4554  df-co 4555  df-dm 4556  df-rn 4557  df-res 4558  df-ima 4559  df-iota 5095  df-fun 5132  df-fn 5133  df-f 5134  df-fv 5138  df-ov 5784  df-oprab 5785  df-mpo 5786  df-1st 6045  df-2nd 6046 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator