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

Theorem ismnddef 12999
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 12676 . . . 4 Base Fn V
2 vex 2763 . . . 4 𝑔 ∈ V
3 funfvex 5571 . . . . 5 ((Fun Base ∧ 𝑔 ∈ dom Base) → (Base‘𝑔) ∈ V)
43funfni 5354 . . . 4 ((Base Fn V ∧ 𝑔 ∈ V) → (Base‘𝑔) ∈ V)
51, 2, 4mp2an 426 . . 3 (Base‘𝑔) ∈ V
6 plusgslid 12730 . . . . 5 (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ)
76slotex 12645 . . . 4 (𝑔 ∈ V → (+g𝑔) ∈ V)
87elv 2764 . . 3 (+g𝑔) ∈ V
9 fveq2 5554 . . . . . . 7 (𝑔 = 𝐺 → (Base‘𝑔) = (Base‘𝐺))
10 ismnddef.b . . . . . . 7 𝐵 = (Base‘𝐺)
119, 10eqtr4di 2244 . . . . . 6 (𝑔 = 𝐺 → (Base‘𝑔) = 𝐵)
1211eqeq2d 2205 . . . . 5 (𝑔 = 𝐺 → (𝑏 = (Base‘𝑔) ↔ 𝑏 = 𝐵))
13 fveq2 5554 . . . . . . 7 (𝑔 = 𝐺 → (+g𝑔) = (+g𝐺))
14 ismnddef.p . . . . . . 7 + = (+g𝐺)
1513, 14eqtr4di 2244 . . . . . 6 (𝑔 = 𝐺 → (+g𝑔) = + )
1615eqeq2d 2205 . . . . 5 (𝑔 = 𝐺 → (𝑝 = (+g𝑔) ↔ 𝑝 = + ))
1712, 16anbi12d 473 . . . 4 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) ↔ (𝑏 = 𝐵𝑝 = + )))
18 simpl 109 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → 𝑏 = 𝐵)
19 oveq 5924 . . . . . . . . 9 (𝑝 = + → (𝑒𝑝𝑎) = (𝑒 + 𝑎))
2019eqeq1d 2202 . . . . . . . 8 (𝑝 = + → ((𝑒𝑝𝑎) = 𝑎 ↔ (𝑒 + 𝑎) = 𝑎))
21 oveq 5924 . . . . . . . . 9 (𝑝 = + → (𝑎𝑝𝑒) = (𝑎 + 𝑒))
2221eqeq1d 2202 . . . . . . . 8 (𝑝 = + → ((𝑎𝑝𝑒) = 𝑎 ↔ (𝑎 + 𝑒) = 𝑎))
2320, 22anbi12d 473 . . . . . . 7 (𝑝 = + → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2423adantl 277 . . . . . 6 ((𝑏 = 𝐵𝑝 = + ) → (((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2518, 24raleqbidv 2706 . . . . 5 ((𝑏 = 𝐵𝑝 = + ) → (∀𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∀𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2618, 25rexeqbidv 2707 . . . 4 ((𝑏 = 𝐵𝑝 = + ) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
2717, 26biimtrdi 163 . . 3 (𝑔 = 𝐺 → ((𝑏 = (Base‘𝑔) ∧ 𝑝 = (+g𝑔)) → (∃𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎))))
285, 8, 27sbc2iedv 3058 . 2 (𝑔 = 𝐺 → ([(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎) ↔ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
29 df-mnd 12998 . 2 Mnd = {𝑔 ∈ Smgrp ∣ [(Base‘𝑔) / 𝑏][(+g𝑔) / 𝑝]𝑒𝑏𝑎𝑏 ((𝑒𝑝𝑎) = 𝑎 ∧ (𝑎𝑝𝑒) = 𝑎)}
3028, 29elrab2 2919 1 (𝐺 ∈ Mnd ↔ (𝐺 ∈ Smgrp ∧ ∃𝑒𝐵𝑎𝐵 ((𝑒 + 𝑎) = 𝑎 ∧ (𝑎 + 𝑒) = 𝑎)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wcel 2164  wral 2472  wrex 2473  Vcvv 2760  [wsbc 2985   Fn wfn 5249  cfv 5254  (class class class)co 5918  Basecbs 12618  +gcplusg 12695  Smgrpcsgrp 12984  Mndcmnd 12997
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-ov 5921  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-mnd 12998
This theorem is referenced by:  ismnd  13000  sgrpidmndm  13001  mndsgrp  13002  mnd1  13027
  Copyright terms: Public domain W3C validator