| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caovdird | GIF version | ||
| Description: Convert an operation distributive law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.) |
| Ref | Expression |
|---|---|
| caovdirg.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝐾)) → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧))) |
| caovdird.2 | ⊢ (𝜑 → 𝐴 ∈ 𝑆) |
| caovdird.3 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
| caovdird.4 | ⊢ (𝜑 → 𝐶 ∈ 𝐾) |
| Ref | Expression |
|---|---|
| caovdird | ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | id 19 | . 2 ⊢ (𝜑 → 𝜑) | |
| 2 | caovdird.2 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑆) | |
| 3 | caovdird.3 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
| 4 | caovdird.4 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝐾) | |
| 5 | caovdirg.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝐾)) → ((𝑥𝐹𝑦)𝐺𝑧) = ((𝑥𝐺𝑧)𝐻(𝑦𝐺𝑧))) | |
| 6 | 5 | caovdirg 6101 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝐾)) → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶))) |
| 7 | 1, 2, 3, 4, 6 | syl13anc 1251 | 1 ⊢ (𝜑 → ((𝐴𝐹𝐵)𝐺𝐶) = ((𝐴𝐺𝐶)𝐻(𝐵𝐺𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 (class class class)co 5922 |
| 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 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-ext 2178 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1475 df-sb 1777 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-un 3161 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-br 4034 df-iota 5219 df-fv 5266 df-ov 5925 |
| This theorem is referenced by: caovdilemd 6115 recexgt0sr 7840 |
| Copyright terms: Public domain | W3C validator |