Theorem pwmnd 18491

Description: The power set of a class 𝐴 is a monoid under union. (Contributed by AV, 27-Feb-2024.)

Hypotheses

Ref	Expression
pwmnd.b	⊢ (Base‘𝑀) = 𝒫 𝐴
pwmnd.p	⊢ (+g‘𝑀) = (𝑥 ∈ 𝒫 𝐴, 𝑦 ∈ 𝒫 𝐴 ↦ (𝑥 ∪ 𝑦))

Assertion

Ref	Expression
pwmnd	⊢ 𝑀 ∈ Mnd

Distinct variable group:   𝑥,𝐴,𝑦

Allowed substitution hints:   𝑀(𝑥,𝑦)

Proof of Theorem pwmnd

Dummy variables 𝑎 𝑏 𝑐 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pwmnd.b	. . . . . 6 ⊢ (Base‘𝑀) = 𝒫 𝐴
2	1	eleq2i 2830	. . . . 5 ⊢ (𝑎 ∈ (Base‘𝑀) ↔ 𝑎 ∈ 𝒫 𝐴)
3	1	eleq2i 2830	. . . . 5 ⊢ (𝑏 ∈ (Base‘𝑀) ↔ 𝑏 ∈ 𝒫 𝐴)
4		pwuncl 7598	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎 ∪ 𝑏) ∈ 𝒫 𝐴)
5		pwmnd.p	. . . . . . . 8 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝒫 𝐴, 𝑦 ∈ 𝒫 𝐴 ↦ (𝑥 ∪ 𝑦))
6	1, 5	pwmndgplus 18489	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∪ 𝑏))
7	1	a1i 11	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (Base‘𝑀) = 𝒫 𝐴)
8	4, 6, 7	3eltr4d 2854	. . . . . 6 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀))
9	1	eleq2i 2830	. . . . . . . 8 ⊢ (𝑐 ∈ (Base‘𝑀) ↔ 𝑐 ∈ 𝒫 𝐴)
10		unass 4096	. . . . . . . . . 10 ⊢ ((𝑎 ∪ 𝑏) ∪ 𝑐) = (𝑎 ∪ (𝑏 ∪ 𝑐))
11	6	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∪ 𝑏))
12	11	oveq1d 7270	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐))
13	1, 5	pwmndgplus 18489	. . . . . . . . . . . 12 ⊢ (((𝑎 ∪ 𝑏) ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
14	4, 13	sylan 579	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
15	12, 14	eqtrd 2778	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
16	1, 5	pwmndgplus 18489	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏(+g‘𝑀)𝑐) = (𝑏 ∪ 𝑐))
17	16	adantll 710	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏(+g‘𝑀)𝑐) = (𝑏 ∪ 𝑐))
18	17	oveq2d 7271	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)) = (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)))
19		simpll 763	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → 𝑎 ∈ 𝒫 𝐴)
20		pwuncl 7598	. . . . . . . . . . . . . 14 ⊢ ((𝑏 ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴)
21	20	adantll 710	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴)
22	19, 21	jca 511	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎 ∈ 𝒫 𝐴 ∧ (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴))
23	1, 5	pwmndgplus 18489	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
24	22, 23	syl 17	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
25	18, 24	eqtrd 2778	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
26	10, 15, 25	3eqtr4a 2805	. . . . . . . . 9 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
27	26	ex 412	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ 𝒫 𝐴 → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
28	9, 27	syl5bi 241	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ (Base‘𝑀) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
29	28	ralrimiv 3106	. . . . . 6 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
30	8, 29	jca 511	. . . . 5 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
31	2, 3, 30	syl2anb 597	. . . 4 ⊢ ((𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → ((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
32	31	rgen2 3126	. . 3 ⊢ ∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
33		0ex 5226	. . . . 5 ⊢ ∅ ∈ V
34		eleq1 2826	. . . . . 6 ⊢ (𝑒 = ∅ → (𝑒 ∈ (Base‘𝑀) ↔ ∅ ∈ (Base‘𝑀)))
35		oveq1 7262	. . . . . . . . 9 ⊢ (𝑒 = ∅ → (𝑒(+g‘𝑀)𝑎) = (∅(+g‘𝑀)𝑎))
36	35	eqeq1d 2740	. . . . . . . 8 ⊢ (𝑒 = ∅ → ((𝑒(+g‘𝑀)𝑎) = 𝑎 ↔ (∅(+g‘𝑀)𝑎) = 𝑎))
37		oveq2 7263	. . . . . . . . 9 ⊢ (𝑒 = ∅ → (𝑎(+g‘𝑀)𝑒) = (𝑎(+g‘𝑀)∅))
38	37	eqeq1d 2740	. . . . . . . 8 ⊢ (𝑒 = ∅ → ((𝑎(+g‘𝑀)𝑒) = 𝑎 ↔ (𝑎(+g‘𝑀)∅) = 𝑎))
39	36, 38	anbi12d 630	. . . . . . 7 ⊢ (𝑒 = ∅ → (((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)))
40	39	ralbidv 3120	. . . . . 6 ⊢ (𝑒 = ∅ → (∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)))
41	34, 40	anbi12d 630	. . . . 5 ⊢ (𝑒 = ∅ → ((𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)) ↔ (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))))
42		0elpw 5273	. . . . . . 7 ⊢ ∅ ∈ 𝒫 𝐴
43	42, 1	eleqtrri 2838	. . . . . 6 ⊢ ∅ ∈ (Base‘𝑀)
44	1, 5	pwmndgplus 18489	. . . . . . . . . . 11 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (∅(+g‘𝑀)𝑎) = (∅ ∪ 𝑎))
45		0un 4323	. . . . . . . . . . 11 ⊢ (∅ ∪ 𝑎) = 𝑎
46	44, 45	eqtrdi 2795	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (∅(+g‘𝑀)𝑎) = 𝑎)
47	1, 5	pwmndgplus 18489	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ ∅ ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = (𝑎 ∪ ∅))
48	47	ancoms 458	. . . . . . . . . . 11 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = (𝑎 ∪ ∅))
49		un0 4321	. . . . . . . . . . 11 ⊢ (𝑎 ∪ ∅) = 𝑎
50	48, 49	eqtrdi 2795	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = 𝑎)
51	46, 50	jca 511	. . . . . . . . 9 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
52	42, 51	mpan 686	. . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝐴 → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
53	2, 52	sylbi 216	. . . . . . 7 ⊢ (𝑎 ∈ (Base‘𝑀) → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
54	53	rgen 3073	. . . . . 6 ⊢ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)
55	43, 54	pm3.2i 470	. . . . 5 ⊢ (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
56	33, 41, 55	ceqsexv2d 3471	. . . 4 ⊢ ∃𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎))
57		df-rex 3069	. . . 4 ⊢ (∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ∃𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)))
58	56, 57	mpbir 230	. . 3 ⊢ ∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)
59	32, 58	pm3.2i 470	. 2 ⊢ (∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))) ∧ ∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎))
60		eqid 2738	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
61		eqid 2738	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
62	60, 61	ismnd 18303	. 2 ⊢ (𝑀 ∈ Mnd ↔ (∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))) ∧ ∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)))
63	59, 62	mpbir 230	1 ⊢ 𝑀 ∈ Mnd

Syntax hints:   ∧ wa 395   = wceq 1539  ∃wex 1783   ∈ wcel 2108  ∀wral 3063  ∃wrex 3064   ∪ cun 3881  ∅c0 4253  𝒫 cpw 4530  ‘cfv 6418  (class class class)co 7255   ∈ cmpo 7257  Basecbs 16840  +_gcplusg 16888  Mndcmnd 18300

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-br 5071  df-opab 5133  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-iota 6376  df-fun 6420  df-fv 6426  df-ov 7258  df-oprab 7259  df-mpo 7260  df-mgm 18241  df-sgrp 18290  df-mnd 18301

This theorem is referenced by: (None)