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

Theorem ismnddef 13120
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 12761 . . . 4 Base Fn V
2 vex 2766 . . . 4 𝑔 ∈ V
3 funfvex 5578 . . . . 5 ((Fun Base ∧ 𝑔 ∈ dom Base) → (Base‘𝑔) ∈ V)
43funfni 5361 . . . 4 ((Base Fn V ∧ 𝑔 ∈ V) → (Base‘𝑔) ∈ V)
51, 2, 4mp2an 426 . . 3 (Base‘𝑔) ∈ V
6 plusgslid 12815 . . . . 5 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
76slotex 12730 . . . 4 (𝑔 ∈ V → (+g𝑔) ∈ V)
87elv 2767 . . 3 (+g𝑔) ∈ V
9 fveq2 5561 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
10 ismnddef.b . . . . . . 7 𝐵 = (Base‘𝐺)
119, 10eqtr4di 2247 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
1211eqeq2d 2208 . . . . 5 (𝑔 = 𝐺 → (𝑏 = (Base‘𝑔) ↔ 𝑏 = 𝐵))
13 fveq2 5561 . . . . . . 7 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
14 ismnddef.p . . . . . . 7 + = (+g𝐺)
1513, 14eqtr4di 2247 . . . . . 6 (𝑔 = 𝐺 → (+g𝑔) = + )
1615eqeq2d 2208 . . . . 5 (𝑔 = 𝐺 → (𝑝 = (+g𝑔) ↔ 𝑝 = + ))
1712, 16anbi12d 473 . . . 4 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) ↔ (𝑏 = 𝐵𝑝 = + )))
18 simpl 109 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → 𝑏 = 𝐵)
19 oveq 5931 . . . . . . . . 9 (𝑝 = + → (𝑒𝑝𝑎) = (𝑒 + 𝑎))
2019eqeq1d 2205 . . . . . . . 8 (𝑝 = + → ((𝑒𝑝𝑎) = 𝑎 ↔ (𝑒 + 𝑎) = 𝑎))
21 oveq 5931 . . . . . . . . 9 (𝑝 = + → (𝑎𝑝𝑒) = (𝑎 + 𝑒))
2221eqeq1d 2205 . . . . . . . 8 (𝑝 = + → ((𝑎𝑝𝑒) = 𝑎 ↔ (𝑎 + 𝑒) = 𝑎))
2320, 22anbi12d 473 . . . . . . 7 (𝑝 = + → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2423adantl 277 . . . . . 6 ((𝑏 = 𝐵𝑝 = + ) → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2518, 24raleqbidv 2709 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → (∀𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∀𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2618, 25rexeqbidv 2710 . . . 4 ((𝑏 = 𝐵𝑝 = + ) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2717, 26biimtrdi 163 . . 3 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎))))
285, 8, 27sbc2iedv 3062 . 2 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
29 df-mnd 13119 . 2 Mnd = {𝑔 ∈ Smgrp ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎)}
3028, 29elrab2 2923 1 (𝐺 ∈ Mnd ↔ (𝐺 ∈ Smgrp ∧ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wcel 2167  wral 2475  wrex 2476  Vcvv 2763  [wsbc 2989   Fn wfn 5254  cfv 5259  (class class class)co 5925  Basecbs 12703  +gcplusg 12780  Smgrpcsgrp 13103  Mndcmnd 13118
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-cnex 7987  ax-resscn 7988  ax-1re 7990  ax-addrcl 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-ov 5928  df-inn 9008  df-2 9066  df-ndx 12706  df-slot 12707  df-base 12709  df-plusg 12793  df-mnd 13119
This theorem is referenced by:  ismnd  13121  sgrpidmndm  13122  mndsgrp  13123  mnd1  13157
  Copyright terms: Public domain W3C validator