MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pwmnd Structured version   Visualization version   GIF version

Theorem pwmnd 18576
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.
StepHypRef Expression
1 pwmnd.b . . . . . 6 (Base‘𝑀) = 𝒫 𝐴
21eleq2i 2830 . . . . 5 (𝑎 ∈ (Base‘𝑀) ↔ 𝑎 ∈ 𝒫 𝐴)
31eleq2i 2830 . . . . 5 (𝑏 ∈ (Base‘𝑀) ↔ 𝑏 ∈ 𝒫 𝐴)
4 pwuncl 7620 . . . . . . 7 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (𝑎𝑏) ∈ 𝒫 𝐴)
5 pwmnd.p . . . . . . . 8 (+g𝑀) = (𝑥 ∈ 𝒫 𝐴, 𝑦 ∈ 𝒫 𝐴 ↦ (𝑥𝑦))
61, 5pwmndgplus 18574 . . . . . . 7 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)𝑏) = (𝑎𝑏))
71a1i 11 . . . . . . 7 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (Base‘𝑀) = 𝒫 𝐴)
84, 6, 73eltr4d 2854 . . . . . 6 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)𝑏) ∈ (Base‘𝑀))
91eleq2i 2830 . . . . . . . 8 (𝑐 ∈ (Base‘𝑀) ↔ 𝑐 ∈ 𝒫 𝐴)
10 unass 4100 . . . . . . . . . 10 ((𝑎𝑏) ∪ 𝑐) = (𝑎 ∪ (𝑏𝑐))
116adantr 481 . . . . . . . . . . . 12 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)𝑏) = (𝑎𝑏))
1211oveq1d 7290 . . . . . . . . . . 11 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = ((𝑎𝑏)(+g𝑀)𝑐))
131, 5pwmndgplus 18574 . . . . . . . . . . . 12 (((𝑎𝑏) ∈ 𝒫 𝐴𝑐 ∈ 𝒫 𝐴) → ((𝑎𝑏)(+g𝑀)𝑐) = ((𝑎𝑏) ∪ 𝑐))
144, 13sylan 580 . . . . . . . . . . 11 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎𝑏)(+g𝑀)𝑐) = ((𝑎𝑏) ∪ 𝑐))
1512, 14eqtrd 2778 . . . . . . . . . 10 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = ((𝑎𝑏) ∪ 𝑐))
161, 5pwmndgplus 18574 . . . . . . . . . . . . 13 ((𝑏 ∈ 𝒫 𝐴𝑐 ∈ 𝒫 𝐴) → (𝑏(+g𝑀)𝑐) = (𝑏𝑐))
1716adantll 711 . . . . . . . . . . . 12 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏(+g𝑀)𝑐) = (𝑏𝑐))
1817oveq2d 7291 . . . . . . . . . . 11 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐)) = (𝑎(+g𝑀)(𝑏𝑐)))
19 simpll 764 . . . . . . . . . . . . 13 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → 𝑎 ∈ 𝒫 𝐴)
20 pwuncl 7620 . . . . . . . . . . . . . 14 ((𝑏 ∈ 𝒫 𝐴𝑐 ∈ 𝒫 𝐴) → (𝑏𝑐) ∈ 𝒫 𝐴)
2120adantll 711 . . . . . . . . . . . . 13 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑏𝑐) ∈ 𝒫 𝐴)
2219, 21jca 512 . . . . . . . . . . . 12 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎 ∈ 𝒫 𝐴 ∧ (𝑏𝑐) ∈ 𝒫 𝐴))
231, 5pwmndgplus 18574 . . . . . . . . . . . 12 ((𝑎 ∈ 𝒫 𝐴 ∧ (𝑏𝑐) ∈ 𝒫 𝐴) → (𝑎(+g𝑀)(𝑏𝑐)) = (𝑎 ∪ (𝑏𝑐)))
2422, 23syl 17 . . . . . . . . . . 11 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)(𝑏𝑐)) = (𝑎 ∪ (𝑏𝑐)))
2518, 24eqtrd 2778 . . . . . . . . . 10 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐)) = (𝑎 ∪ (𝑏𝑐)))
2610, 15, 253eqtr4a 2804 . . . . . . . . 9 (((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) ∧ 𝑐 ∈ 𝒫 𝐴) → ((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐)))
2726ex 413 . . . . . . . 8 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ 𝒫 𝐴 → ((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐))))
289, 27syl5bi 241 . . . . . . 7 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → (𝑐 ∈ (Base‘𝑀) → ((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐))))
2928ralrimiv 3102 . . . . . 6 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐)))
308, 29jca 512 . . . . 5 ((𝑎 ∈ 𝒫 𝐴𝑏 ∈ 𝒫 𝐴) → ((𝑎(+g𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐))))
312, 3, 30syl2anb 598 . . . 4 ((𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → ((𝑎(+g𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐))))
3231rgen2 3120 . . 3 𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐)))
33 0ex 5231 . . . . 5 ∅ ∈ V
34 eleq1 2826 . . . . . 6 (𝑒 = ∅ → (𝑒 ∈ (Base‘𝑀) ↔ ∅ ∈ (Base‘𝑀)))
35 oveq1 7282 . . . . . . . . 9 (𝑒 = ∅ → (𝑒(+g𝑀)𝑎) = (∅(+g𝑀)𝑎))
3635eqeq1d 2740 . . . . . . . 8 (𝑒 = ∅ → ((𝑒(+g𝑀)𝑎) = 𝑎 ↔ (∅(+g𝑀)𝑎) = 𝑎))
37 oveq2 7283 . . . . . . . . 9 (𝑒 = ∅ → (𝑎(+g𝑀)𝑒) = (𝑎(+g𝑀)∅))
3837eqeq1d 2740 . . . . . . . 8 (𝑒 = ∅ → ((𝑎(+g𝑀)𝑒) = 𝑎 ↔ (𝑎(+g𝑀)∅) = 𝑎))
3936, 38anbi12d 631 . . . . . . 7 (𝑒 = ∅ → (((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎) ↔ ((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎)))
4039ralbidv 3112 . . . . . 6 (𝑒 = ∅ → (∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎) ↔ ∀𝑎 ∈ (Base‘𝑀)((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎)))
4134, 40anbi12d 631 . . . . 5 (𝑒 = ∅ → ((𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎)) ↔ (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎))))
42 0elpw 5278 . . . . . . 7 ∅ ∈ 𝒫 𝐴
4342, 1eleqtrri 2838 . . . . . 6 ∅ ∈ (Base‘𝑀)
441, 5pwmndgplus 18574 . . . . . . . . . . 11 ((∅ ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐴) → (∅(+g𝑀)𝑎) = (∅ ∪ 𝑎))
45 0un 4326 . . . . . . . . . . 11 (∅ ∪ 𝑎) = 𝑎
4644, 45eqtrdi 2794 . . . . . . . . . 10 ((∅ ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐴) → (∅(+g𝑀)𝑎) = 𝑎)
471, 5pwmndgplus 18574 . . . . . . . . . . . 12 ((𝑎 ∈ 𝒫 𝐴 ∧ ∅ ∈ 𝒫 𝐴) → (𝑎(+g𝑀)∅) = (𝑎 ∪ ∅))
4847ancoms 459 . . . . . . . . . . 11 ((∅ ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)∅) = (𝑎 ∪ ∅))
49 un0 4324 . . . . . . . . . . 11 (𝑎 ∪ ∅) = 𝑎
5048, 49eqtrdi 2794 . . . . . . . . . 10 ((∅ ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐴) → (𝑎(+g𝑀)∅) = 𝑎)
5146, 50jca 512 . . . . . . . . 9 ((∅ ∈ 𝒫 𝐴𝑎 ∈ 𝒫 𝐴) → ((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎))
5242, 51mpan 687 . . . . . . . 8 (𝑎 ∈ 𝒫 𝐴 → ((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎))
532, 52sylbi 216 . . . . . . 7 (𝑎 ∈ (Base‘𝑀) → ((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎))
5453rgen 3074 . . . . . 6 𝑎 ∈ (Base‘𝑀)((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎)
5543, 54pm3.2i 471 . . . . 5 (∅ ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((∅(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)∅) = 𝑎))
5633, 41, 55ceqsexv2d 3481 . . . 4 𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎))
57 df-rex 3070 . . . 4 (∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎) ↔ ∃𝑒(𝑒 ∈ (Base‘𝑀) ∧ ∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎)))
5856, 57mpbir 230 . . 3 𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎)
5932, 58pm3.2i 471 . 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𝑀)
6260, 61ismnd 18388 . 2 (𝑀 ∈ Mnd ↔ (∀𝑎 ∈ (Base‘𝑀)∀𝑏 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏) ∈ (Base‘𝑀) ∧ ∀𝑐 ∈ (Base‘𝑀)((𝑎(+g𝑀)𝑏)(+g𝑀)𝑐) = (𝑎(+g𝑀)(𝑏(+g𝑀)𝑐))) ∧ ∃𝑒 ∈ (Base‘𝑀)∀𝑎 ∈ (Base‘𝑀)((𝑒(+g𝑀)𝑎) = 𝑎 ∧ (𝑎(+g𝑀)𝑒) = 𝑎)))
6359, 62mpbir 230 1 𝑀 ∈ Mnd
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1539  wex 1782  wcel 2106  wral 3064  wrex 3065  cun 3885  c0 4256  𝒫 cpw 4533  cfv 6433  (class class class)co 7275  cmpo 7277  Basecbs 16912  +gcplusg 16962  Mndcmnd 18385
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-mgm 18326  df-sgrp 18375  df-mnd 18386
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator