Theorem assintopcllaw 48715

Description: The closure low holds for an associative (closed internal binary) operation for a set. (Contributed by FL, 2-Nov-2009.) (Revised by AV, 20-Jan-2020.)

Assertion

Ref	Expression
assintopcllaw	⊢ ( ⚬ ∈ ( assIntOp ‘𝑀) → ⚬ clLaw 𝑀)

Proof of Theorem assintopcllaw

Dummy variable 𝑜 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elfvex 6865	. 2 ⊢ ( ⚬ ∈ ( assIntOp ‘𝑀) → 𝑀 ∈ V)
2		assintopval 48708	. . . . 5 ⊢ (𝑀 ∈ V → ( assIntOp ‘𝑀) = {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀})
3	2	eleq2d 2827	. . . 4 ⊢ (𝑀 ∈ V → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ⚬ ∈ {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀}))
4		breq1 5077	. . . . 5 ⊢ (𝑜 = ⚬ → (𝑜 assLaw 𝑀 ↔ ⚬ assLaw 𝑀))
5	4	elrab 3630	. . . 4 ⊢ ( ⚬ ∈ {𝑜 ∈ ( clIntOp ‘𝑀) ∣ 𝑜 assLaw 𝑀} ↔ ( ⚬ ∈ ( clIntOp ‘𝑀) ∧ ⚬ assLaw 𝑀))
6	3, 5	bitrdi 289	. . 3 ⊢ (𝑀 ∈ V → ( ⚬ ∈ ( assIntOp ‘𝑀) ↔ ( ⚬ ∈ ( clIntOp ‘𝑀) ∧ ⚬ assLaw 𝑀)))
7		clintopcllaw 48714	. . . 4 ⊢ ( ⚬ ∈ ( clIntOp ‘𝑀) → ⚬ clLaw 𝑀)
8	7	adantr 482	. . 3 ⊢ (( ⚬ ∈ ( clIntOp ‘𝑀) ∧ ⚬ assLaw 𝑀) → ⚬ clLaw 𝑀)
9	6, 8	biimtrdi 255	. 2 ⊢ (𝑀 ∈ V → ( ⚬ ∈ ( assIntOp ‘𝑀) → ⚬ clLaw 𝑀))
10	1, 9	mpcom 38	1 ⊢ ( ⚬ ∈ ( assIntOp ‘𝑀) → ⚬ clLaw 𝑀)

Syntax hints:   → wi 4   ∧ wa 397   ∈ wcel 2121  {crab 3393  Vcvv 3433   class class class wbr 5074  ‘cfv 6488   clLaw ccllaw 48686   assLaw casslaw 48687   clIntOp cclintop 48700   assIntOp cassintop 48701

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4841  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-id 5515  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-fv 6496  df-ov 7362  df-oprab 7363  df-mpo 7364  df-map 8769  df-cllaw 48689  df-intop 48702  df-clintop 48703  df-assintop 48704

This theorem is referenced by: (None)