| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > oprab2co | GIF version | ||
| Description: Composition of operator abstractions. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by David Abernethy, 23-Apr-2013.) |
| Ref | Expression |
|---|---|
| oprab2co.1 | ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝑅) |
| oprab2co.2 | ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑆) |
| oprab2co.3 | ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 〈𝐶, 𝐷〉) |
| oprab2co.4 | ⊢ 𝐺 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝐶𝑀𝐷)) |
| Ref | Expression |
|---|---|
| oprab2co | ⊢ (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀 ∘ 𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oprab2co.1 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐶 ∈ 𝑅) | |
| 2 | oprab2co.2 | . . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 𝐷 ∈ 𝑆) | |
| 3 | opelxpi 4705 | . . 3 ⊢ ((𝐶 ∈ 𝑅 ∧ 𝐷 ∈ 𝑆) → 〈𝐶, 𝐷〉 ∈ (𝑅 × 𝑆)) | |
| 4 | 1, 2, 3 | syl2anc 411 | . 2 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → 〈𝐶, 𝐷〉 ∈ (𝑅 × 𝑆)) |
| 5 | oprab2co.3 | . 2 ⊢ 𝐹 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 〈𝐶, 𝐷〉) | |
| 6 | oprab2co.4 | . . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝐶𝑀𝐷)) | |
| 7 | df-ov 5937 | . . . . 5 ⊢ (𝐶𝑀𝐷) = (𝑀‘〈𝐶, 𝐷〉) | |
| 8 | 7 | a1i 9 | . . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐶𝑀𝐷) = (𝑀‘〈𝐶, 𝐷〉)) |
| 9 | 8 | mpoeq3ia 6000 | . . 3 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝐶𝑀𝐷)) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑀‘〈𝐶, 𝐷〉)) |
| 10 | 6, 9 | eqtri 2225 | . 2 ⊢ 𝐺 = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ (𝑀‘〈𝐶, 𝐷〉)) |
| 11 | 4, 5, 10 | oprabco 6293 | 1 ⊢ (𝑀 Fn (𝑅 × 𝑆) → 𝐺 = (𝑀 ∘ 𝐹)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1372 ∈ wcel 2175 〈cop 3635 × cxp 4671 ∘ ccom 4677 Fn wfn 5263 ‘cfv 5268 (class class class)co 5934 ∈ cmpo 5936 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4478 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4338 df-xp 4679 df-rel 4680 df-cnv 4681 df-co 4682 df-dm 4683 df-rn 4684 df-res 4685 df-ima 4686 df-iota 5229 df-fun 5270 df-fn 5271 df-f 5272 df-fv 5276 df-ov 5937 df-oprab 5938 df-mpo 5939 df-1st 6216 df-2nd 6217 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |