Theorem clcllaw 47914

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 47909	. . . 4 ⊢ clLaw = {⟨𝑜, 𝑚⟩ ∣ ∀𝑥 ∈ 𝑚 ∀𝑦 ∈ 𝑚 (𝑥𝑜𝑦) ∈ 𝑚}
2	1	bropaex12 5791	. . 3 ⊢ ( ⚬ clLaw 𝑀 → ( ⚬ ∈ V ∧ 𝑀 ∈ V))
3		iscllaw 47912	. . . 4 ⊢ (( ⚬ ∈ V ∧ 𝑀 ∈ V) → ( ⚬ clLaw 𝑀 ↔ ∀𝑥 ∈ 𝑀 ∀𝑦 ∈ 𝑀 (𝑥 ⚬ 𝑦) ∈ 𝑀))
4		ovrspc2v 7474	. . . . 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 1087   ∈ wcel 2108  ∀wral 3067  Vcvv 3488   class class class wbr 5166  (class class class)co 7448   clLaw ccllaw 47906

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-xp 5706  df-iota 6525  df-fv 6581  df-ov 7451  df-cllaw 47909

This theorem is referenced by: (None)