Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > caovdid | GIF version |
Description: Convert an operation distributive law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.) |
Ref | Expression |
---|---|
caovdig.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧))) |
caovdid.2 | ⊢ (𝜑 → 𝐴 ∈ 𝐾) |
caovdid.3 | ⊢ (𝜑 → 𝐵 ∈ 𝑆) |
caovdid.4 | ⊢ (𝜑 → 𝐶 ∈ 𝑆) |
Ref | Expression |
---|---|
caovdid | ⊢ (𝜑 → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | id 19 | . 2 ⊢ (𝜑 → 𝜑) | |
2 | caovdid.2 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝐾) | |
3 | caovdid.3 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑆) | |
4 | caovdid.4 | . 2 ⊢ (𝜑 → 𝐶 ∈ 𝑆) | |
5 | caovdig.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐾 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → (𝑥𝐺(𝑦𝐹𝑧)) = ((𝑥𝐺𝑦)𝐻(𝑥𝐺𝑧))) | |
6 | 5 | caovdig 6027 | . 2 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝐾 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))) |
7 | 1, 2, 3, 4, 6 | syl13anc 1235 | 1 ⊢ (𝜑 → (𝐴𝐺(𝐵𝐹𝐶)) = ((𝐴𝐺𝐵)𝐻(𝐴𝐺𝐶))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∧ w3a 973 = wceq 1348 ∈ wcel 2141 (class class class)co 5853 |
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 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-ext 2152 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-un 3125 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-iota 5160 df-fv 5206 df-ov 5856 |
This theorem is referenced by: caovdir2d 6029 caovlem2d 6045 ltanqg 7362 |
Copyright terms: Public domain | W3C validator |