Theorem isasslaw 44452

Description: The predicate "is an associative operation". (Contributed by FL, 1-Nov-2009.) (Revised by AV, 13-Jan-2020.)

Assertion

Ref	Expression
isasslaw	⊢ (( ⚬ ∈ 𝑉 ∧ 𝑀 ∈ 𝑊) → ( ⚬ assLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))

Distinct variable groups:   𝑥,𝑀,𝑦,𝑧   𝑥, ⚬ ,𝑦,𝑧

Allowed substitution hints:   𝑉(𝑥,𝑦,𝑧)   𝑊(𝑥,𝑦,𝑧)

Proof of Theorem isasslaw

Dummy variables 𝑚 𝑜 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 488	. . 3 ⊢ ((𝑜 = ⚬ ∧ 𝑚 = 𝑀) → 𝑚 = 𝑀)
2		id 22	. . . . . . . 8 ⊢ (𝑜 = ⚬ → 𝑜 = ⚬ )
3		oveq 7141	. . . . . . . 8 ⊢ (𝑜 = ⚬ → (𝑥𝑜𝑦) = (𝑥 ⚬ 𝑦))
4		eqidd 2799	. . . . . . . 8 ⊢ (𝑜 = ⚬ → 𝑧 = 𝑧)
5	2, 3, 4	oveq123d 7156	. . . . . . 7 ⊢ (𝑜 = ⚬ → ((𝑥𝑜𝑦)𝑜𝑧) = ((𝑥 ⚬ 𝑦) ⚬ 𝑧))
6		eqidd 2799	. . . . . . . 8 ⊢ (𝑜 = ⚬ → 𝑥 = 𝑥)
7		oveq 7141	. . . . . . . 8 ⊢ (𝑜 = ⚬ → (𝑦𝑜𝑧) = (𝑦 ⚬ 𝑧))
8	2, 6, 7	oveq123d 7156	. . . . . . 7 ⊢ (𝑜 = ⚬ → (𝑥𝑜(𝑦𝑜𝑧)) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))
9	5, 8	eqeq12d 2814	. . . . . 6 ⊢ (𝑜 = ⚬ → (((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧)) ↔ ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
10	9	adantr 484	. . . . 5 ⊢ ((𝑜 = ⚬ ∧ 𝑚 = 𝑀) → (((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧)) ↔ ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
11	1, 10	raleqbidv 3354	. . . 4 ⊢ ((𝑜 = ⚬ ∧ 𝑚 = 𝑀) → (∀𝑧 ∈ 𝑚 ((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧)) ↔ ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
12	1, 11	raleqbidv 3354	. . 3 ⊢ ((𝑜 = ⚬ ∧ 𝑚 = 𝑀) → (∀𝑦 ∈ 𝑚 ∀𝑧 ∈ 𝑚 ((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧)) ↔ ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
13	1, 12	raleqbidv 3354	. 2 ⊢ ((𝑜 = ⚬ ∧ 𝑚 = 𝑀) → (∀𝑥 ∈ 𝑚 ∀𝑦 ∈ 𝑚 ∀𝑧 ∈ 𝑚 ((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧)) ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
14		df-asslaw 44448	. 2 ⊢ assLaw = {⟨𝑜, 𝑚⟩ ∣ ∀𝑥 ∈ 𝑚 ∀𝑦 ∈ 𝑚 ∀𝑧 ∈ 𝑚 ((𝑥𝑜𝑦)𝑜𝑧) = (𝑥𝑜(𝑦𝑜𝑧))}
15	13, 14	brabga 5386	1 ⊢ (( ⚬ ∈ 𝑉 ∧ 𝑀 ∈ 𝑊) → ( ⚬ assLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106   class class class wbr 5030  (class class class)co 7135   assLaw casslaw 44444

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ral 3111  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-iota 6283  df-fv 6332  df-ov 7138  df-asslaw 44448

This theorem is referenced by:  asslawass  44453  sgrpplusgaopALT  44455  isassintop  44470  assintopass  44474  sgrp2sgrp  44488