![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > caovassg | Structured version Visualization version 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 3201 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧))) |
3 | oveq1 7433 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥𝐹𝑦) = (𝐴𝐹𝑦)) | |
4 | 3 | oveq1d 7441 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥𝐹𝑦)𝐹𝑧) = ((𝐴𝐹𝑦)𝐹𝑧)) |
5 | oveq1 7433 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥𝐹(𝑦𝐹𝑧)) = (𝐴𝐹(𝑦𝐹𝑧))) | |
6 | 4, 5 | eqeq12d 2744 | . . 3 ⊢ (𝑥 = 𝐴 → (((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) ↔ ((𝐴𝐹𝑦)𝐹𝑧) = (𝐴𝐹(𝑦𝐹𝑧)))) |
7 | oveq2 7434 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴𝐹𝑦) = (𝐴𝐹𝐵)) | |
8 | 7 | oveq1d 7441 | . . . 4 ⊢ (𝑦 = 𝐵 → ((𝐴𝐹𝑦)𝐹𝑧) = ((𝐴𝐹𝐵)𝐹𝑧)) |
9 | oveq1 7433 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝑦𝐹𝑧) = (𝐵𝐹𝑧)) | |
10 | 9 | oveq2d 7442 | . . . 4 ⊢ (𝑦 = 𝐵 → (𝐴𝐹(𝑦𝐹𝑧)) = (𝐴𝐹(𝐵𝐹𝑧))) |
11 | 8, 10 | eqeq12d 2744 | . . 3 ⊢ (𝑦 = 𝐵 → (((𝐴𝐹𝑦)𝐹𝑧) = (𝐴𝐹(𝑦𝐹𝑧)) ↔ ((𝐴𝐹𝐵)𝐹𝑧) = (𝐴𝐹(𝐵𝐹𝑧)))) |
12 | oveq2 7434 | . . . 4 ⊢ (𝑧 = 𝐶 → ((𝐴𝐹𝐵)𝐹𝑧) = ((𝐴𝐹𝐵)𝐹𝐶)) | |
13 | oveq2 7434 | . . . . 5 ⊢ (𝑧 = 𝐶 → (𝐵𝐹𝑧) = (𝐵𝐹𝐶)) | |
14 | 13 | oveq2d 7442 | . . . 4 ⊢ (𝑧 = 𝐶 → (𝐴𝐹(𝐵𝐹𝑧)) = (𝐴𝐹(𝐵𝐹𝐶))) |
15 | 12, 14 | eqeq12d 2744 | . . 3 ⊢ (𝑧 = 𝐶 → (((𝐴𝐹𝐵)𝐹𝑧) = (𝐴𝐹(𝐵𝐹𝑧)) ↔ ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))) |
16 | 6, 11, 15 | rspc3v 3627 | . 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 ∀𝑧 ∈ 𝑆 ((𝑥𝐹𝑦)𝐹𝑧) = (𝑥𝐹(𝑦𝐹𝑧)) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶)))) |
17 | 2, 16 | mpan9 505 | 1 ⊢ ((𝜑 ∧ (𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑆)) → ((𝐴𝐹𝐵)𝐹𝐶) = (𝐴𝐹(𝐵𝐹𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 ∀wral 3058 (class class class)co 7426 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-ext 2699 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2706 df-cleq 2720 df-clel 2806 df-ral 3059 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-br 5153 df-iota 6505 df-fv 6561 df-ov 7429 |
This theorem is referenced by: caovassd 7626 caovass 7627 seqsplit 14040 seqcaopr 14044 seqf1olem2 14047 grpinvalem 18640 grpinva 18641 grprida 18642 |
Copyright terms: Public domain | W3C validator |