| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > caovassg | GIF version | ||
| Description: Convert an operation associative law to class notation. (Contributed by Mario Carneiro, 1-Jun-2013.) (Revised by Mario Carneiro, 26-May-2014.) |
| Ref | Expression |
|---|---|
| caovassg.1 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) |
| Ref | Expression |
|---|---|
| caovassg | ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caovassg.1 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) | |
| 2 | 1 | ralrimivvva 2591 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) |
| 3 | oveq1 5974 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
| 4 | 3 | oveq1d 5982 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦)𝐹𝑧) = ((𝐴𝐹𝑦)𝐹𝑧)) |
| 5 | oveq1 5974 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹(𝑦𝐹𝑧)) = (𝐴𝐹(𝑦𝐹𝑧))) | |
| 6 | 4, 5 | eqeq12d 2222 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) ↔ ((𝐴𝐹𝑦)𝐹𝑧) = (𝐴𝐹(𝑦𝐹𝑧)))) |
| 7 | oveq2 5975 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
| 8 | 7 | oveq1d 5982 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦)𝐹𝑧) = ((𝐴𝐹𝐵)𝐹𝑧)) |
| 9 | oveq1 5974 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦𝐹𝑧) = (𝐵𝐹𝑧)) | |
| 10 | 9 | oveq2d 5983 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹(𝑦𝐹𝑧)) = (𝐴𝐹(𝐵𝐹𝑧))) |
| 11 | 8, 10 | eqeq12d 2222 | . . 3 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦)𝐹𝑧) = (𝐴𝐹(𝑦𝐹𝑧)) ↔ ((𝐴𝐹𝐵)𝐹𝑧) = (𝐴𝐹(𝐵𝐹𝑧)))) |
| 12 | oveq2 5975 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐹𝐵)𝐹𝑧) = ((𝐴𝐹𝐵)𝐹𝐶)) | |
| 13 | oveq2 5975 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝐵𝐹𝑧) = (𝐵𝐹𝐶)) | |
| 14 | 13 | oveq2d 5983 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝐴𝐹(𝐵𝐹𝑧)) = (𝐴𝐹(𝐵𝐹𝐶))) |
| 15 | 12, 14 | eqeq12d 2222 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝐴𝐹𝐵)𝐹𝑧) = (𝐴𝐹(𝐵𝐹𝑧)) ↔ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))) |
| 16 | 6, 11, 15 | rspc3v 2900 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))) |
| 17 | 2, 16 | mpan9 281 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2178 ∀wral 2486 (class class class)co 5967 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-v 2778 df-un 3178 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-br 4060 df-iota 5251 df-fv 5298 df-ov 5970 |
| This theorem is referenced by: caovassd 6129 caovass 6130 seq3split 10670 seqsplitg 10671 seq3caopr 10677 seqcaoprg 10678 seqf1oglem2 10702 grpinvalem 13332 grpinva 13333 grprida 13334 |
| Copyright terms: Public domain | W3C validator |