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

Theorem isnsgrp 17288
Description: A condition for a structure not to be a semigroup. (Contributed by AV, 30-Jan-2020.)
Hypotheses
Ref Expression
issgrpn0.b 𝐵 = (Base‘𝑀)
issgrpn0.o = (+g𝑀)
Assertion
Ref Expression
isnsgrp ((𝑋𝐵𝑌𝐵𝑍𝐵) → (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) → 𝑀 ∉ SGrp))

Proof of Theorem isnsgrp
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpl1 1064 . . . . . . 7 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑋𝐵)
2 oveq1 6657 . . . . . . . . . . . . 13 (𝑥 = 𝑋 → (𝑥 𝑦) = (𝑋 𝑦))
32oveq1d 6665 . . . . . . . . . . . 12 (𝑥 = 𝑋 → ((𝑥 𝑦) 𝑧) = ((𝑋 𝑦) 𝑧))
4 oveq1 6657 . . . . . . . . . . . 12 (𝑥 = 𝑋 → (𝑥 (𝑦 𝑧)) = (𝑋 (𝑦 𝑧)))
53, 4eqeq12d 2637 . . . . . . . . . . 11 (𝑥 = 𝑋 → (((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
65notbid 308 . . . . . . . . . 10 (𝑥 = 𝑋 → (¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
76rexbidv 3052 . . . . . . . . 9 (𝑥 = 𝑋 → (∃𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
87rexbidv 3052 . . . . . . . 8 (𝑥 = 𝑋 → (∃𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
98adantl 482 . . . . . . 7 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑥 = 𝑋) → (∃𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
10 simpl2 1065 . . . . . . . 8 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑌𝐵)
11 oveq2 6658 . . . . . . . . . . . . 13 (𝑦 = 𝑌 → (𝑋 𝑦) = (𝑋 𝑌))
1211oveq1d 6665 . . . . . . . . . . . 12 (𝑦 = 𝑌 → ((𝑋 𝑦) 𝑧) = ((𝑋 𝑌) 𝑧))
13 oveq1 6657 . . . . . . . . . . . . 13 (𝑦 = 𝑌 → (𝑦 𝑧) = (𝑌 𝑧))
1413oveq2d 6666 . . . . . . . . . . . 12 (𝑦 = 𝑌 → (𝑋 (𝑦 𝑧)) = (𝑋 (𝑌 𝑧)))
1512, 14eqeq12d 2637 . . . . . . . . . . 11 (𝑦 = 𝑌 → (((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1615notbid 308 . . . . . . . . . 10 (𝑦 = 𝑌 → (¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1716adantl 482 . . . . . . . . 9 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑦 = 𝑌) → (¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1817rexbidv 3052 . . . . . . . 8 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑦 = 𝑌) → (∃𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ∃𝑧𝐵 ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
19 simpl3 1066 . . . . . . . . 9 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑍𝐵)
20 oveq2 6658 . . . . . . . . . . . 12 (𝑧 = 𝑍 → ((𝑋 𝑌) 𝑧) = ((𝑋 𝑌) 𝑍))
21 oveq2 6658 . . . . . . . . . . . . 13 (𝑧 = 𝑍 → (𝑌 𝑧) = (𝑌 𝑍))
2221oveq2d 6666 . . . . . . . . . . . 12 (𝑧 = 𝑍 → (𝑋 (𝑌 𝑧)) = (𝑋 (𝑌 𝑍)))
2320, 22eqeq12d 2637 . . . . . . . . . . 11 (𝑧 = 𝑍 → (((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
2423notbid 308 . . . . . . . . . 10 (𝑧 = 𝑍 → (¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
2524adantl 482 . . . . . . . . 9 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑧 = 𝑍) → (¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
26 neneq 2800 . . . . . . . . . 10 (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) → ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍)))
2726adantl 482 . . . . . . . . 9 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍)))
2819, 25, 27rspcedvd 3317 . . . . . . . 8 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑧𝐵 ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)))
2910, 18, 28rspcedvd 3317 . . . . . . 7 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)))
301, 9, 29rspcedvd 3317 . . . . . 6 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
31 rexnal 2995 . . . . . . . 8 (∃𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
32312rexbii 3042 . . . . . . 7 (∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑥𝐵𝑦𝐵 ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
33 rexnal2 3043 . . . . . . 7 (∃𝑥𝐵𝑦𝐵 ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3432, 33bitr2i 265 . . . . . 6 (¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3530, 34sylibr 224 . . . . 5 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3635intnand 962 . . . 4 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ (𝑀 ∈ Mgm ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧))))
37 issgrpn0.b . . . . 5 𝐵 = (Base‘𝑀)
38 issgrpn0.o . . . . 5 = (+g𝑀)
3937, 38issgrp 17285 . . . 4 (𝑀 ∈ SGrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧))))
4036, 39sylnibr 319 . . 3 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ 𝑀 ∈ SGrp)
41 df-nel 2898 . . 3 (𝑀 ∉ SGrp ↔ ¬ 𝑀 ∈ SGrp)
4240, 41sylibr 224 . 2 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑀 ∉ SGrp)
4342ex 450 1 ((𝑋𝐵𝑌𝐵𝑍𝐵) → (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) → 𝑀 ∉ SGrp))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wcel 1990  wne 2794  wnel 2897  wral 2912  wrex 2913  cfv 5888  (class class class)co 6650  Basecbs 15857  +gcplusg 15941  Mgmcmgm 17240  SGrpcsgrp 17283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896  df-ov 6653  df-sgrp 17284
This theorem is referenced by:  mgm2nsgrplem4  17408  xrsnsgrp  19782
  Copyright terms: Public domain W3C validator