Theorem clcllaw 48301

Description: Closure of a closed operation. (Contributed by FL, 14-Sep-2010.) (Revised by AV, 21-Jan-2020.)

Assertion

Ref	Expression
clcllaw	⊢ (( ⚬ clLaw 𝑀 ∧ 𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀)

Proof of Theorem clcllaw

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

Step	Hyp	Ref	Expression
1		df-cllaw 48296	. . . 4 ⊢ clLaw = {⟨𝑜, 𝑚⟩ ∣ ∀𝑥 ∈ 𝑚 ∀𝑦 ∈ 𝑚 (𝑥𝑜𝑦) ∈ 𝑚}
2	1	bropaex12 5705	. . 3 ⊢ ( ⚬ clLaw 𝑀 → ( ⚬ ∈ V ∧ 𝑀 ∈ V))
3		iscllaw 48299	. . . 4 ⊢ (( ⚬ ∈ V ∧ 𝑀 ∈ V) → ( ⚬ clLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 (𝑥 ⚬ 𝑦) ∈ 𝑀))
4		ovrspc2v 7372	. . . . 5 ⊢ (((𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) ∧ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 (𝑥 ⚬ 𝑦) ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀)
5	4	expcom 413	. . . 4 ⊢ (∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 (𝑥 ⚬ 𝑦) ∈ 𝑀 → ((𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀))
6	3, 5	biimtrdi 253	. . 3 ⊢ (( ⚬ ∈ V ∧ 𝑀 ∈ V) → ( ⚬ clLaw 𝑀 → ((𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀)))
7	2, 6	mpcom 38	. 2 ⊢ ( ⚬ clLaw 𝑀 → ((𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀))
8	7	3impib 1116	1 ⊢ (( ⚬ clLaw 𝑀 ∧ 𝑋 ∈ 𝑀 ∧ 𝑌 ∈ 𝑀) → (𝑋 ⚬ 𝑌) ∈ 𝑀)

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   ∈ wcel 2111  ∀wral 3047  Vcvv 3436   class class class wbr 5089  (class class class)co 7346   clLaw ccllaw 48293

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-xp 5620  df-iota 6437  df-fv 6489  df-ov 7349  df-cllaw 48296

This theorem is referenced by: (None)