ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ismnddef GIF version

Theorem ismnddef 13564
Description: The predicate "is a monoid", corresponding 1-to-1 to the definition. (Contributed by FL, 2-Nov-2009.) (Revised by AV, 1-Feb-2020.)
Hypotheses
Ref Expression
ismnddef.b 𝐵 = (Base‘𝐺)
ismnddef.p + = (+g𝐺)
Assertion
Ref Expression
ismnddef (𝐺 ∈ Mnd ↔ (𝐺 ∈ Smgrp ∧ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
Distinct variable groups:   𝐵,𝑎,𝑒   + ,𝑎,𝑒
Allowed substitution hints:   𝐺(𝑒,𝑎)

Proof of Theorem ismnddef
Dummy variables 𝑏 𝑔 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 basfn 13204 . . . 4 Base Fn V
2 vex 2806 . . . 4 𝑔 ∈ V
3 funfvex 5665 . . . . 5 ((Fun Base ∧ 𝑔 ∈ dom Base) → (Base‘𝑔) ∈ V)
43funfni 5439 . . . 4 ((Base Fn V ∧ 𝑔 ∈ V) → (Base‘𝑔) ∈ V)
51, 2, 4mp2an 426 . . 3 (Base‘𝑔) ∈ V
6 plusgslid 13258 . . . . 5 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
76slotex 13172 . . . 4 (𝑔 ∈ V → (+g𝑔) ∈ V)
87elv 2807 . . 3 (+g𝑔) ∈ V
9 fveq2 5648 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
10 ismnddef.b . . . . . . 7 𝐵 = (Base‘𝐺)
119, 10eqtr4di 2282 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
1211eqeq2d 2243 . . . . 5 (𝑔 = 𝐺 → (𝑏 = (Base‘𝑔) ↔ 𝑏 = 𝐵))
13 fveq2 5648 . . . . . . 7 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
14 ismnddef.p . . . . . . 7 + = (+g𝐺)
1513, 14eqtr4di 2282 . . . . . 6 (𝑔 = 𝐺 → (+g𝑔) = + )
1615eqeq2d 2243 . . . . 5 (𝑔 = 𝐺 → (𝑝 = (+g𝑔) ↔ 𝑝 = + ))
1712, 16anbi12d 473 . . . 4 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) ↔ (𝑏 = 𝐵𝑝 = + )))
18 simpl 109 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → 𝑏 = 𝐵)
19 oveq 6034 . . . . . . . . 9 (𝑝 = + → (𝑒𝑝𝑎) = (𝑒 + 𝑎))
2019eqeq1d 2240 . . . . . . . 8 (𝑝 = + → ((𝑒𝑝𝑎) = 𝑎 ↔ (𝑒 + 𝑎) = 𝑎))
21 oveq 6034 . . . . . . . . 9 (𝑝 = + → (𝑎𝑝𝑒) = (𝑎 + 𝑒))
2221eqeq1d 2240 . . . . . . . 8 (𝑝 = + → ((𝑎𝑝𝑒) = 𝑎 ↔ (𝑎 + 𝑒) = 𝑎))
2320, 22anbi12d 473 . . . . . . 7 (𝑝 = + → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2423adantl 277 . . . . . 6 ((𝑏 = 𝐵𝑝 = + ) → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2518, 24raleqbidv 2747 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → (∀𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∀𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2618, 25rexeqbidv 2748 . . . 4 ((𝑏 = 𝐵𝑝 = + ) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2717, 26biimtrdi 163 . . 3 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎))))
285, 8, 27sbc2iedv 3105 . 2 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
29 df-mnd 13563 . 2 Mnd = {𝑔 ∈ Smgrp ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎)}
3028, 29elrab2 2966 1 (𝐺 ∈ Mnd ↔ (𝐺 ∈ Smgrp ∧ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  wcel 2202  wral 2511  wrex 2512  Vcvv 2803  [wsbc 3032   Fn wfn 5328  cfv 5333  (class class class)co 6028  Basecbs 13145  +gcplusg 13223  Smgrpcsgrp 13547  Mndcmnd 13562
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-rab 2520  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ov 6031  df-inn 9186  df-2 9244  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mnd 13563
This theorem is referenced by:  ismnd  13565  sgrpidmndm  13566  mndsgrp  13567  mnd1  13601
  Copyright terms: Public domain W3C validator