Theorem mgm2nsgrplem2 18084

Description: Lemma 2 for mgm2nsgrp 18087. (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

Step	Hyp	Ref	Expression
1		prid1g 4696	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴, 𝐵})
2		mgm2nsgrp.s	. . 3 ⊢ 𝑆 = {𝐴, 𝐵}
3	1, 2	eleqtrrdi 2924	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑆)
4		prid2g 4697	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ {𝐴, 𝐵})
5	4, 2	eleqtrrdi 2924	. 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ 𝑆)
6		mgm2nsgrp.p	. . . . 5 ⊢ ⚬ = (+g‘𝑀)
7		mgm2nsgrp.o	. . . . 5 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
8	6, 7	eqtri 2844	. . . 4 ⊢ ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
9	8	a1i 11	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴)))
10		ifeq1 4471	. . . . . . 7 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴))
11		ifid 4506	. . . . . . 7 ⊢ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴) = 𝐴
12	10, 11	syl6eq 2872	. . . . . 6 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
13	12	a1d 25	. . . . 5 ⊢ (𝐵 = 𝐴 → (𝑦 = 𝐵 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
14		eqeq1 2825	. . . . . . . . . . 11 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐴 ↔ 𝐵 = 𝐴))
15	14	bicomd 225	. . . . . . . . . 10 ⊢ (𝑦 = 𝐵 → (𝐵 = 𝐴 ↔ 𝑦 = 𝐴))
16	15	notbid 320	. . . . . . . . 9 ⊢ (𝑦 = 𝐵 → (¬ 𝐵 = 𝐴 ↔ ¬ 𝑦 = 𝐴))
17	16	biimpac 481	. . . . . . . 8 ⊢ ((¬ 𝐵 = 𝐴 ∧ 𝑦 = 𝐵) → ¬ 𝑦 = 𝐴)
18	17	intnand 491	. . . . . . 7 ⊢ ((¬ 𝐵 = 𝐴 ∧ 𝑦 = 𝐵) → ¬ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴))
19	18	iffalsed 4478	. . . . . 6 ⊢ ((¬ 𝐵 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
20	19	ex 415	. . . . 5 ⊢ (¬ 𝐵 = 𝐴 → (𝑦 = 𝐵 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
21	13, 20	pm2.61i 184	. . . 4 ⊢ (𝑦 = 𝐵 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
22	21	ad2antll 727	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = (𝐴 ⚬ 𝐴) ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
23		iftrue 4473	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
24	23	adantl 484	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
25		simpl 485	. . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐴 ∈ 𝑆)
26		simpr 487	. . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐵 ∈ 𝑆)
27	9, 24, 25, 25, 26	ovmpod 7302	. . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐴) = 𝐵)
28	27, 26	eqeltrd 2913	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐴) ∈ 𝑆)
29	9, 22, 28, 26, 25	ovmpod 7302	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ((𝐴 ⚬ 𝐴) ⚬ 𝐵) = 𝐴)
30	3, 5, 29	syl2an 597	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ((𝐴 ⚬ 𝐴) ⚬ 𝐵) = 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398   = wceq 1537   ∈ wcel 2114  ifcif 4467  {cpr 4569  ‘cfv 6355  (class class class)co 7156   ∈ cmpo 7158  Basecbs 16483  +_gcplusg 16565

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-iota 6314  df-fun 6357  df-fv 6363  df-ov 7159  df-oprab 7160  df-mpo 7161

This theorem is referenced by:  mgm2nsgrplem4  18086