Theorem isassintop 48701

Description: The predicate "is an associative (closed internal binary) operations for a set". (Contributed by FL, 2-Nov-2009.) (Revised by AV, 20-Jan-2020.)

Assertion

Ref	Expression
isassintop	⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))))

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

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

Proof of Theorem isassintop

Dummy variable 𝑜 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		assintopmap 48697	. . . . 5 ⊢ (𝑀 ∈ 𝑉 → ( assIntOp ‘𝑀) = {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀})
2	1	eleq2d 2823	. . . 4 ⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ⚬ ∈ {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀}))
3		breq1 5089	. . . . 5 ⊢ (𝑜 = ⚬ → (𝑜 assLaw 𝑀 ↔ ⚬ assLaw 𝑀))
4	3	elrab 3635	. . . 4 ⊢ ( ⚬ ∈ {𝑜 ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∣ 𝑜 assLaw 𝑀} ↔ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀))
5	2, 4	bitrdi 287	. . 3 ⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀)))
6		elmapi 8790	. . . . . 6 ⊢ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) → ⚬ :(𝑀 × 𝑀)⟶𝑀)
7	6	ad2antrl 729	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀)) → ⚬ :(𝑀 × 𝑀)⟶𝑀)
8		isasslaw 48683	. . . . . . . 8 ⊢ (( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ 𝑀 ∈ 𝑉) → ( ⚬ assLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
9	8	biimpd 229	. . . . . . 7 ⊢ (( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ 𝑀 ∈ 𝑉) → ( ⚬ assLaw 𝑀 → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
10	9	impancom 451	. . . . . 6 ⊢ (( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀) → (𝑀 ∈ 𝑉 → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
11	10	impcom 407	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀)) → ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))
12	7, 11	jca 511	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀)) → ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
13	12	ex 412	. . 3 ⊢ (𝑀 ∈ 𝑉 → (( ⚬ ∈ (𝑀 ↑m (𝑀 × 𝑀)) ∧ ⚬ assLaw 𝑀) → ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))))
14	5, 13	sylbid 240	. 2 ⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( assIntOp ‘𝑀) → ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))))
15		isclintop 48698	. . . . . . 7 ⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( clIntOp ‘𝑀) ↔ ⚬ :(𝑀 × 𝑀)⟶𝑀))
16	15	biimprcd 250	. . . . . 6 ⊢ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 → (𝑀 ∈ 𝑉 → ⚬ ∈ ( clIntOp ‘𝑀)))
17	16	adantr 480	. . . . 5 ⊢ (( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))) → (𝑀 ∈ 𝑉 → ⚬ ∈ ( clIntOp ‘𝑀)))
18	17	impcom 407	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ⚬ ∈ ( clIntOp ‘𝑀))
19		sqxpexg 7703	. . . . . . . . 9 ⊢ (𝑀 ∈ 𝑉 → (𝑀 × 𝑀) ∈ V)
20		fex 7175	. . . . . . . . 9 ⊢ (( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ (𝑀 × 𝑀) ∈ V) → ⚬ ∈ V)
21	19, 20	sylan2 594	. . . . . . . 8 ⊢ (( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ 𝑀 ∈ 𝑉) → ⚬ ∈ V)
22	21	ancoms 458	. . . . . . 7 ⊢ ((𝑀 ∈ 𝑉 ∧ ⚬ :(𝑀 × 𝑀)⟶𝑀) → ⚬ ∈ V)
23		simpl 482	. . . . . . 7 ⊢ ((𝑀 ∈ 𝑉 ∧ ⚬ :(𝑀 × 𝑀)⟶𝑀) → 𝑀 ∈ 𝑉)
24		isasslaw 48683	. . . . . . . 8 ⊢ (( ⚬ ∈ V ∧ 𝑀 ∈ 𝑉) → ( ⚬ assLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))))
25	24	bicomd 223	. . . . . . 7 ⊢ (( ⚬ ∈ V ∧ 𝑀 ∈ 𝑉) → (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) ↔ ⚬ assLaw 𝑀))
26	22, 23, 25	syl2anc 585	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ ⚬ :(𝑀 × 𝑀)⟶𝑀) → (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) ↔ ⚬ assLaw 𝑀))
27	26	biimpd 229	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ ⚬ :(𝑀 × 𝑀)⟶𝑀) → (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)) → ⚬ assLaw 𝑀))
28	27	impr 454	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ⚬ assLaw 𝑀)
29		assintopval 48696	. . . . . . 7 ⊢ (𝑀 ∈ 𝑉 → ( assIntOp ‘𝑀) = {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀})
30	29	adantr 480	. . . . . 6 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ( assIntOp ‘𝑀) = {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀})
31	30	eleq2d 2823	. . . . 5 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ⚬ ∈ {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀}))
32	3	elrab 3635	. . . . 5 ⊢ ( ⚬ ∈ {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀} ↔ ( ⚬ ∈ ( clIntOp ‘𝑀) ∧ ⚬ assLaw 𝑀))
33	31, 32	bitrdi 287	. . . 4 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ( ⚬ ∈ ( clIntOp ‘𝑀) ∧ ⚬ assLaw 𝑀)))
34	18, 28, 33	mpbir2and 714	. . 3 ⊢ ((𝑀 ∈ 𝑉 ∧ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))) → ⚬ ∈ ( assIntOp ‘𝑀))
35	34	ex 412	. 2 ⊢ (𝑀 ∈ 𝑉 → (( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧))) → ⚬ ∈ ( assIntOp ‘𝑀)))
36	14, 35	impbid 212	1 ⊢ (𝑀 ∈ 𝑉 → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ( ⚬ :(𝑀 × 𝑀)⟶𝑀 ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 ∀𝑧 ∈ 𝑀 ((𝑥 ⚬ 𝑦) ⚬ 𝑧) = (𝑥 ⚬ (𝑦 ⚬ 𝑧)))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052  {crab 3390  Vcvv 3430   class class class wbr 5086   × cxp 5623  ⟶wf 6489  ‘cfv 6493  (class class class)co 7361   ↑_m cmap 8767   assLaw casslaw 48675   clIntOp cclintop 48688   assIntOp cassintop 48689

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371  ax-un 7683

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-1st 7936  df-2nd 7937  df-map 8769  df-asslaw 48679  df-intop 48690  df-clintop 48691  df-assintop 48692

This theorem is referenced by: (None)