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

Theorem mgm2nsgrplem2 17229
 Description: Lemma 2 for mgm2nsgrp 17232. (Contributed by AV, 27-Jan-2020.)
Hypotheses
Ref Expression
mgm2nsgrp.s 𝑆 = {𝐴, 𝐵}
mgm2nsgrp.b (Base‘𝑀) = 𝑆
mgm2nsgrp.o (+g𝑀) = (𝑥𝑆, 𝑦𝑆 ↦ if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴))
mgm2nsgrp.p = (+g𝑀)
Assertion
Ref Expression
mgm2nsgrplem2 ((𝐴𝑉𝐵𝑊) → ((𝐴 𝐴) 𝐵) = 𝐴)
Distinct variable groups:   𝑥,𝑆,𝑦   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑀   𝑥, ,𝑦
Allowed substitution hints:   𝑀(𝑦)   𝑉(𝑥,𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem mgm2nsgrplem2
StepHypRef Expression
1 prid1g 4239 . . 3 (𝐴𝑉𝐴 ∈ {𝐴, 𝐵})
2 mgm2nsgrp.s . . 3 𝑆 = {𝐴, 𝐵}
31, 2syl6eleqr 2699 . 2 (𝐴𝑉𝐴𝑆)
4 prid2g 4240 . . 3 (𝐵𝑊𝐵 ∈ {𝐴, 𝐵})
54, 2syl6eleqr 2699 . 2 (𝐵𝑊𝐵𝑆)
6 mgm2nsgrp.p . . . . 5 = (+g𝑀)
7 mgm2nsgrp.o . . . . 5 (+g𝑀) = (𝑥𝑆, 𝑦𝑆 ↦ if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴))
86, 7eqtri 2632 . . . 4 = (𝑥𝑆, 𝑦𝑆 ↦ if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴))
98a1i 11 . . 3 ((𝐴𝑆𝐵𝑆) → = (𝑥𝑆, 𝑦𝑆 ↦ if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴)))
10 ifeq1 4040 . . . . . . 7 (𝐵 = 𝐴 → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = if((𝑥 = 𝐴𝑦 = 𝐴), 𝐴, 𝐴))
11 ifid 4075 . . . . . . 7 if((𝑥 = 𝐴𝑦 = 𝐴), 𝐴, 𝐴) = 𝐴
1210, 11syl6eq 2660 . . . . . 6 (𝐵 = 𝐴 → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
1312a1d 25 . . . . 5 (𝐵 = 𝐴 → (𝑦 = 𝐵 → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
14 eqeq1 2614 . . . . . . . . . . 11 (𝑦 = 𝐵 → (𝑦 = 𝐴𝐵 = 𝐴))
1514bicomd 212 . . . . . . . . . 10 (𝑦 = 𝐵 → (𝐵 = 𝐴𝑦 = 𝐴))
1615notbid 307 . . . . . . . . 9 (𝑦 = 𝐵 → (¬ 𝐵 = 𝐴 ↔ ¬ 𝑦 = 𝐴))
1716biimpac 502 . . . . . . . 8 ((¬ 𝐵 = 𝐴𝑦 = 𝐵) → ¬ 𝑦 = 𝐴)
1817intnand 953 . . . . . . 7 ((¬ 𝐵 = 𝐴𝑦 = 𝐵) → ¬ (𝑥 = 𝐴𝑦 = 𝐴))
1918iffalsed 4047 . . . . . 6 ((¬ 𝐵 = 𝐴𝑦 = 𝐵) → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
2019ex 449 . . . . 5 𝐵 = 𝐴 → (𝑦 = 𝐵 → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
2113, 20pm2.61i 175 . . . 4 (𝑦 = 𝐵 → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
2221ad2antll 761 . . 3 (((𝐴𝑆𝐵𝑆) ∧ (𝑥 = (𝐴 𝐴) ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
23 iftrue 4042 . . . . . 6 ((𝑥 = 𝐴𝑦 = 𝐴) → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
2423adantl 481 . . . . 5 (((𝐴𝑆𝐵𝑆) ∧ (𝑥 = 𝐴𝑦 = 𝐴)) → if((𝑥 = 𝐴𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
25 simpl 472 . . . . 5 ((𝐴𝑆𝐵𝑆) → 𝐴𝑆)
26 simpr 476 . . . . 5 ((𝐴𝑆𝐵𝑆) → 𝐵𝑆)
279, 24, 25, 25, 26ovmpt2d 6686 . . . 4 ((𝐴𝑆𝐵𝑆) → (𝐴 𝐴) = 𝐵)
2827, 26eqeltrd 2688 . . 3 ((𝐴𝑆𝐵𝑆) → (𝐴 𝐴) ∈ 𝑆)
299, 22, 28, 26, 25ovmpt2d 6686 . 2 ((𝐴𝑆𝐵𝑆) → ((𝐴 𝐴) 𝐵) = 𝐴)
303, 5, 29syl2an 493 1 ((𝐴𝑉𝐵𝑊) → ((𝐴 𝐴) 𝐵) = 𝐴)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977  ifcif 4036  {cpr 4127  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  Basecbs 15695  +gcplusg 15768 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-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 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-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  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-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-iota 5768  df-fun 5806  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554 This theorem is referenced by:  mgm2nsgrplem4  17231
 Copyright terms: Public domain W3C validator