Theorem pwmnd 18908

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 2828	. . . . 5 ⊢ (𝑎 ∈ (Base‘𝑀) ↔ 𝑎 ∈ 𝒫 𝐴)
3	1	eleq2i 2828	. . . . 5 ⊢ (𝑏 ∈ (Base‘𝑀) ↔ 𝑏 ∈ 𝒫 𝐴)
4		pwuncl 7724	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎 ∪ 𝑏) ∈ 𝒫 𝐴)
5		pwmnd.p	. . . . . . . 8 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝒫 𝐴, 𝑦 ∈ 𝒫 𝐴 ↦ (𝑥 ∪ 𝑦))
6	1, 5	pwmndgplus 18906	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∪ 𝑏))
7	1	a1i 11	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (Base‘𝑀) = 𝒫 𝐴)
8	4, 6, 7	3eltr4d 2851	. . . . . 6 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀))
9	1	eleq2i 2828	. . . . . . . 8 ⊢ (𝑐 ∈ (Base‘𝑀) ↔ 𝑐 ∈ 𝒫 𝐴)
10		unass 4112	. . . . . . . . . 10 ⊢ ((𝑎 ∪ 𝑏) ∪ 𝑐) = (𝑎 ∪ (𝑏 ∪ 𝑐))
11	6	adantr 480	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∪ 𝑏))
12	11	oveq1d 7382	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐))
13	1, 5	pwmndgplus 18906	. . . . . . . . . . . 12 ⊢ (((𝑎 ∪ 𝑏) ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
14	4, 13	sylan 581	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎 ∪ 𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
15	12, 14	eqtrd 2771	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = ((𝑎 ∪ 𝑏) ∪ 𝑐))
16	1, 5	pwmndgplus 18906	. . . . . . . . . . . . 13 ⊢ ((𝑏 ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏(+g‘𝑀)𝑐) = (𝑏 ∪ 𝑐))
17	16	adantll 715	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏(+g‘𝑀)𝑐) = (𝑏 ∪ 𝑐))
18	17	oveq2d 7383	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)) = (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)))
19		simpll 767	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → 𝑎 ∈ 𝒫 𝐴)
20		pwuncl 7724	. . . . . . . . . . . . . 14 ⊢ ((𝑏 ∈ 𝒫 𝐴 ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴)
21	20	adantll 715	. . . . . . . . . . . . 13 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴)
22	19, 21	jca 511	. . . . . . . . . . . 12 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎 ∈ 𝒫 𝐴 ∧ (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴))
23	1, 5	pwmndgplus 18906	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ (𝑏 ∪ 𝑐) ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
24	22, 23	syl 17	. . . . . . . . . . 11 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏 ∪ 𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
25	18, 24	eqtrd 2771	. . . . . . . . . 10 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)) = (𝑎 ∪ (𝑏 ∪ 𝑐)))
26	10, 15, 25	3eqtr4a 2797	. . . . . . . . 9 ⊢ (((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
27	26	ex 412	. . . . . . . 8 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ 𝒫 𝐴 → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
28	9, 27	biimtrid 242	. . . . . . 7 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ (Base‘𝑀) → ((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
29	28	ralrimiv 3128	. . . . . 6 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
30	8, 29	jca 511	. . . . 5 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴) → ((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
31	2, 3, 30	syl2anb 599	. . . 4 ⊢ ((𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → ((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))))
32	31	rgen2 3177	. . 3 ⊢ ∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐)))
33		0ex 5242	. . . . 5 ⊢ ∅ ∈ V
34		eleq1 2824	. . . . . 6 ⊢ (𝑒 = ∅ → (𝑒 ∈ (Base‘𝑀) ↔ ∅ ∈ (Base‘𝑀)))
35		oveq1 7374	. . . . . . . . 9 ⊢ (𝑒 = ∅ → (𝑒(+g‘𝑀)𝑎) = (∅(+g‘𝑀)𝑎))
36	35	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑒 = ∅ → ((𝑒(+g‘𝑀)𝑎) = 𝑎 ↔ (∅(+g‘𝑀)𝑎) = 𝑎))
37		oveq2 7375	. . . . . . . . 9 ⊢ (𝑒 = ∅ → (𝑎(+g‘𝑀)𝑒) = (𝑎(+g‘𝑀)∅))
38	37	eqeq1d 2738	. . . . . . . 8 ⊢ (𝑒 = ∅ → ((𝑎(+g‘𝑀)𝑒) = 𝑎 ↔ (𝑎(+g‘𝑀)∅) = 𝑎))
39	36, 38	anbi12d 633	. . . . . . 7 ⊢ (𝑒 = ∅ → (((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)))
40	39	ralbidv 3160	. . . . . 6 ⊢ (𝑒 = ∅ → (∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)))
41	34, 40	anbi12d 633	. . . . 5 ⊢ (𝑒 = ∅ → ((𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)) ↔ (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))))
42		0elpw 5297	. . . . . . 7 ⊢ ∅ ∈ 𝒫 𝐴
43	42, 1	eleqtrri 2835	. . . . . 6 ⊢ ∅ ∈ (Base‘𝑀)
44	1, 5	pwmndgplus 18906	. . . . . . . . . . 11 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (∅(+g‘𝑀)𝑎) = (∅ ∪ 𝑎))
45		0un 4336	. . . . . . . . . . 11 ⊢ (∅ ∪ 𝑎) = 𝑎
46	44, 45	eqtrdi 2787	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (∅(+g‘𝑀)𝑎) = 𝑎)
47	1, 5	pwmndgplus 18906	. . . . . . . . . . . 12 ⊢ ((𝑎 ∈ 𝒫 𝐴 ∧ ∅ ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = (𝑎 ∪ ∅))
48	47	ancoms 458	. . . . . . . . . . 11 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = (𝑎 ∪ ∅))
49		un0 4334	. . . . . . . . . . 11 ⊢ (𝑎 ∪ ∅) = 𝑎
50	48, 49	eqtrdi 2787	. . . . . . . . . 10 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → (𝑎(+g‘𝑀)∅) = 𝑎)
51	46, 50	jca 511	. . . . . . . . 9 ⊢ ((∅ ∈ 𝒫 𝐴 ∧ 𝑎 ∈ 𝒫 𝐴) → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
52	42, 51	mpan 691	. . . . . . . 8 ⊢ (𝑎 ∈ 𝒫 𝐴 → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
53	2, 52	sylbi 217	. . . . . . 7 ⊢ (𝑎 ∈ (Base‘𝑀) → ((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
54	53	rgen 3053	. . . . . 6 ⊢ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎)
55	43, 54	pm3.2i 470	. . . . 5 ⊢ (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)∅) = 𝑎))
56	33, 41, 55	ceqsexv2d 3479	. . . 4 ⊢ ∃𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎))
57		df-rex 3062	. . . 4 ⊢ (∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎) ↔ ∃𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)))
58	56, 57	mpbir 231	. . 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 2736	. . 3 ⊢ (Base‘𝑀) = (Base‘𝑀)
61		eqid 2736	. . 3 ⊢ (+g‘𝑀) = (+g‘𝑀)
62	60, 61	ismnd 18705	. 2 ⊢ (𝑀 ∈ Mnd ↔ (∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g‘𝑀)𝑏)(+g‘𝑀)𝑐) = (𝑎(+g‘𝑀)(𝑏(+g‘𝑀)𝑐))) ∧ ∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g‘𝑀)𝑎) = 𝑎 ∧ (𝑎(+g‘𝑀)𝑒) = 𝑎)))
63	59, 62	mpbir 231	1 ⊢ 𝑀 ∈ Mnd

Syntax hints:   ∧ wa 395   = wceq 1542  ∃wex 1781   ∈ wcel 2114  ∀wral 3051  ∃wrex 3061   ∪ cun 3887  ∅c0 4273  𝒫 cpw 4541  ‘cfv 6498  (class class class)co 7367   ∈ cmpo 7369  Basecbs 17179  +_gcplusg 17220  Mndcmnd 18702

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 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375  ax-un 7689

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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-iota 6454  df-fun 6500  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-mgm 18608  df-sgrp 18687  df-mnd 18703

This theorem is referenced by: (None)