Theorem mgm2nsgrplem3 18988

Description: Lemma 3 for mgm2nsgrp 18990. (Contributed by AV, 28-Jan-2020.)

Hypotheses

Ref	Expression
mgm2nsgrp.s	⊢ 𝑆 = {𝐴, 𝐵}
mgm2nsgrp.b	⊢ (Base‘𝑀) = 𝑆
mgm2nsgrp.o	⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
mgm2nsgrp.p	⊢ ⚬ = (+g‘𝑀)

Assertion

Ref	Expression
mgm2nsgrplem3	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ⚬ (𝐴 ⚬ 𝐵)) = 𝐵)

Distinct variable groups:   𝑥,𝑆,𝑦   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑀   𝑥, ⚬ ,𝑦

Allowed substitution hints:   𝑀(𝑦)   𝑉(𝑥, 𝑦)   𝑊(𝑥, 𝑦)

Proof of Theorem mgm2nsgrplem3

Step	Hyp	Ref	Expression
1		prid1g 4725	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴, 𝐵})
2		mgm2nsgrp.s	. . 3 ⊢ 𝑆 = {𝐴, 𝐵}
3	1, 2	eleqtrrdi 2873	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑆)
4		prid2g 4726	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ {𝐴, 𝐵})
5	4, 2	eleqtrrdi 2873	. 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ 𝑆)
6		mgm2nsgrp.p	. . . . 5 ⊢ ⚬ = (+g‘𝑀)
7		mgm2nsgrp.o	. . . . 5 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
8	6, 7	eqtri 2785	. . . 4 ⊢ ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
9	8	a1i 11	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴)))
10		simprl 782	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → 𝑥 = 𝐴)
11		simpr 489	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵)) → 𝑦 = (𝐴 ⚬ 𝐵))
12		ifeq1 4490	. . . . . . . . . . 11 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴))
13		ifid 4527	. . . . . . . . . . 11 ⊢ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴) = 𝐴
14	12, 13	eqtrdi 2813	. . . . . . . . . 10 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
15	14	a1d 26	. . . . . . . . 9 ⊢ (𝐵 = 𝐴 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
16		eqeq1 2766	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐴 ↔ 𝐵 = 𝐴))
17	16	biimpcd 252	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝐴 → (𝑦 = 𝐵 → 𝐵 = 𝐴))
18	17	adantl 486	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → (𝑦 = 𝐵 → 𝐵 = 𝐴))
19	18	com12 33	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝐵 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → 𝐵 = 𝐴))
20	19	adantl 486	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → 𝐵 = 𝐴))
21	20	con3d 153	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (¬ 𝐵 = 𝐴 → ¬ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)))
22	21	impcom 412	. . . . . . . . . . 11 ⊢ ((¬ 𝐵 = 𝐴 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ¬ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴))
23	22	iffalsed 4497	. . . . . . . . . 10 ⊢ ((¬ 𝐵 = 𝐴 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
24	23	ex 417	. . . . . . . . 9 ⊢ (¬ 𝐵 = 𝐴 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
25	15, 24	pm2.61i 184	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
26	25	adantl 486	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
27		simpl 487	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐴 ∈ 𝑆)
28		simpr 489	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐵 ∈ 𝑆)
29	9, 26, 27, 28, 27	ovmpod 7564	. . . . . 6 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐵) = 𝐴)
30	11, 29	sylan9eqr 2819	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → 𝑦 = 𝐴)
31	10, 30	jca 520	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → (𝑥 = 𝐴 ∧ 𝑦 = 𝐴))
32	31	iftrued 4494	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
33	29, 27	eqeltrd 2862	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐵) ∈ 𝑆)
34	9, 32, 27, 33, 28	ovmpod 7564	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ (𝐴 ⚬ 𝐵)) = 𝐵)
35	3, 5, 34	syl2an 607	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ⚬ (𝐴 ⚬ 𝐵)) = 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1569   ∈ wcel 2142  ifcif 4486  {cpr 4590  ‘cfv 6536  (class class class)co 7412   ∈ cmpo 7414  Basecbs 17275  +_gcplusg 17316

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7415  df-oprab 7416  df-mpo 7417

This theorem is used by:  mgm2nsgrplem4  18989