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

Theorem isnmnd 18764
Description: A condition for a structure not to be a monoid: every element of the base set is not a left identity for at least one element of the base set. (Contributed by AV, 4-Feb-2020.)
Hypotheses
Ref Expression
isnmnd.b 𝐵 = (Base‘𝑀)
isnmnd.o = (+g𝑀)
Assertion
Ref Expression
isnmnd (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥𝑀 ∉ Mnd)
Distinct variable groups:   𝑥,𝐵,𝑧   𝑥,𝑀,𝑧   𝑥, ,𝑧

Proof of Theorem isnmnd
StepHypRef Expression
1 neneq 2944 . . . . . . . 8 ((𝑧 𝑥) ≠ 𝑥 → ¬ (𝑧 𝑥) = 𝑥)
21intnanrd 489 . . . . . . 7 ((𝑧 𝑥) ≠ 𝑥 → ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
32reximi 3082 . . . . . 6 (∃𝑥𝐵 (𝑧 𝑥) ≠ 𝑥 → ∃𝑥𝐵 ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
43ralimi 3081 . . . . 5 (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥 → ∀𝑧𝐵𝑥𝐵 ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
5 rexnal 3098 . . . . . . 7 (∃𝑥𝐵 ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥) ↔ ¬ ∀𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
65ralbii 3091 . . . . . 6 (∀𝑧𝐵𝑥𝐵 ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥) ↔ ∀𝑧𝐵 ¬ ∀𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
7 ralnex 3070 . . . . . 6 (∀𝑧𝐵 ¬ ∀𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥) ↔ ¬ ∃𝑧𝐵𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
86, 7bitri 275 . . . . 5 (∀𝑧𝐵𝑥𝐵 ¬ ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥) ↔ ¬ ∃𝑧𝐵𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
94, 8sylib 218 . . . 4 (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥 → ¬ ∃𝑧𝐵𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥))
109intnand 488 . . 3 (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥 → ¬ (𝑀 ∈ Smgrp ∧ ∃𝑧𝐵𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥)))
11 isnmnd.b . . . 4 𝐵 = (Base‘𝑀)
12 isnmnd.o . . . 4 = (+g𝑀)
1311, 12ismnddef 18762 . . 3 (𝑀 ∈ Mnd ↔ (𝑀 ∈ Smgrp ∧ ∃𝑧𝐵𝑥𝐵 ((𝑧 𝑥) = 𝑥 ∧ (𝑥 𝑧) = 𝑥)))
1410, 13sylnibr 329 . 2 (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥 → ¬ 𝑀 ∈ Mnd)
15 df-nel 3045 . 2 (𝑀 ∉ Mnd ↔ ¬ 𝑀 ∈ Mnd)
1614, 15sylibr 234 1 (∀𝑧𝐵𝑥𝐵 (𝑧 𝑥) ≠ 𝑥𝑀 ∉ Mnd)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1537  wcel 2106  wne 2938  wnel 3044  wral 3059  wrex 3068  cfv 6563  (class class class)co 7431  Basecbs 17245  +gcplusg 17298  Smgrpcsgrp 18744  Mndcmnd 18760
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-nul 5312
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-dif 3966  df-un 3968  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-iota 6516  df-fv 6571  df-ov 7434  df-mnd 18761
This theorem is referenced by:  sgrp2nmndlem5  18955  copisnmnd  48013  nnsgrpnmnd  48022  2zrngnring  48102
  Copyright terms: Public domain W3C validator