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

Theorem isnsgrp 17111
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 1057 . . . . . . 7 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑋𝐵)
2 oveq1 6556 . . . . . . . . . . . . 13 (𝑥 = 𝑋 → (𝑥 𝑦) = (𝑋 𝑦))
32oveq1d 6564 . . . . . . . . . . . 12 (𝑥 = 𝑋 → ((𝑥 𝑦) 𝑧) = ((𝑋 𝑦) 𝑧))
4 oveq1 6556 . . . . . . . . . . . 12 (𝑥 = 𝑋 → (𝑥 (𝑦 𝑧)) = (𝑋 (𝑦 𝑧)))
53, 4eqeq12d 2625 . . . . . . . . . . 11 (𝑥 = 𝑋 → (((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
65notbid 307 . . . . . . . . . 10 (𝑥 = 𝑋 → (¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
76rexbidv 3034 . . . . . . . . 9 (𝑥 = 𝑋 → (∃𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
87rexbidv 3034 . . . . . . . 8 (𝑥 = 𝑋 → (∃𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
98adantl 481 . . . . . . 7 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑥 = 𝑋) → (∃𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧))))
10 simpl2 1058 . . . . . . . 8 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑌𝐵)
11 oveq2 6557 . . . . . . . . . . . . 13 (𝑦 = 𝑌 → (𝑋 𝑦) = (𝑋 𝑌))
1211oveq1d 6564 . . . . . . . . . . . 12 (𝑦 = 𝑌 → ((𝑋 𝑦) 𝑧) = ((𝑋 𝑌) 𝑧))
13 oveq1 6556 . . . . . . . . . . . . 13 (𝑦 = 𝑌 → (𝑦 𝑧) = (𝑌 𝑧))
1413oveq2d 6565 . . . . . . . . . . . 12 (𝑦 = 𝑌 → (𝑋 (𝑦 𝑧)) = (𝑋 (𝑌 𝑧)))
1512, 14eqeq12d 2625 . . . . . . . . . . 11 (𝑦 = 𝑌 → (((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1615notbid 307 . . . . . . . . . 10 (𝑦 = 𝑌 → (¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1716adantl 481 . . . . . . . . 9 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑦 = 𝑌) → (¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
1817rexbidv 3034 . . . . . . . 8 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑦 = 𝑌) → (∃𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)) ↔ ∃𝑧𝐵 ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧))))
19 simpl3 1059 . . . . . . . . 9 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑍𝐵)
20 oveq2 6557 . . . . . . . . . . . 12 (𝑧 = 𝑍 → ((𝑋 𝑌) 𝑧) = ((𝑋 𝑌) 𝑍))
21 oveq2 6557 . . . . . . . . . . . . 13 (𝑧 = 𝑍 → (𝑌 𝑧) = (𝑌 𝑍))
2221oveq2d 6565 . . . . . . . . . . . 12 (𝑧 = 𝑍 → (𝑋 (𝑌 𝑧)) = (𝑋 (𝑌 𝑍)))
2320, 22eqeq12d 2625 . . . . . . . . . . 11 (𝑧 = 𝑍 → (((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
2423notbid 307 . . . . . . . . . 10 (𝑧 = 𝑍 → (¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
2524adantl 481 . . . . . . . . 9 ((((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) ∧ 𝑧 = 𝑍) → (¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)) ↔ ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍))))
26 df-ne 2782 . . . . . . . . . . 11 (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) ↔ ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍)))
2726biimpi 205 . . . . . . . . . 10 (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) → ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍)))
2827adantl 481 . . . . . . . . 9 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ ((𝑋 𝑌) 𝑍) = (𝑋 (𝑌 𝑍)))
2919, 25, 28rspcedvd 3289 . . . . . . . 8 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑧𝐵 ¬ ((𝑋 𝑌) 𝑧) = (𝑋 (𝑌 𝑧)))
3010, 18, 29rspcedvd 3289 . . . . . . 7 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑦𝐵𝑧𝐵 ¬ ((𝑋 𝑦) 𝑧) = (𝑋 (𝑦 𝑧)))
311, 9, 30rspcedvd 3289 . . . . . 6 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
32 rexnal 2978 . . . . . . . 8 (∃𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
33322rexbii 3024 . . . . . . 7 (∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑥𝐵𝑦𝐵 ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
34 rexnal2 3025 . . . . . . 7 (∃𝑥𝐵𝑦𝐵 ¬ ∀𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3533, 34bitr2i 264 . . . . . 6 (¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)) ↔ ∃𝑥𝐵𝑦𝐵𝑧𝐵 ¬ ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3631, 35sylibr 223 . . . . 5 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧)))
3736intnand 953 . . . 4 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ (𝑀 ∈ Mgm ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧))))
38 issgrpn0.b . . . . 5 𝐵 = (Base‘𝑀)
39 issgrpn0.o . . . . 5 = (+g𝑀)
4038, 39issgrp 17108 . . . 4 (𝑀 ∈ SGrp ↔ (𝑀 ∈ Mgm ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 𝑦) 𝑧) = (𝑥 (𝑦 𝑧))))
4137, 40sylnibr 318 . . 3 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → ¬ 𝑀 ∈ SGrp)
42 df-nel 2783 . . 3 (𝑀 ∉ SGrp ↔ ¬ 𝑀 ∈ SGrp)
4341, 42sylibr 223 . 2 (((𝑋𝐵𝑌𝐵𝑍𝐵) ∧ ((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍))) → 𝑀 ∉ SGrp)
4443ex 449 1 ((𝑋𝐵𝑌𝐵𝑍𝐵) → (((𝑋 𝑌) 𝑍) ≠ (𝑋 (𝑌 𝑍)) → 𝑀 ∉ SGrp))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  w3a 1031   = wceq 1475  wcel 1977  wne 2780  wnel 2781  wral 2896  wrex 2897  cfv 5804  (class class class)co 6549  Basecbs 15695  +gcplusg 15768  Mgmcmgm 17063  SGrpcsgrp 17106
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-nul 4717
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-iota 5768  df-fv 5812  df-ov 6552  df-sgrp 17107
This theorem is referenced by:  mgm2nsgrplem4  17231  xrsnsgrp  19601
  Copyright terms: Public domain W3C validator