Theorem mgm2nsgrplem3 19119

Description: Lemma 3 for mgm2nsgrp 19121. (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 4720	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴, 𝐵})
2		mgm2nsgrp.s	. . 3 ⊢ 𝑆 = {𝐴, 𝐵}
3	1, 2	eleqtrrdi 2871	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑆)
4		prid2g 4721	. . 3 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ {𝐴, 𝐵})
5	4, 2	eleqtrrdi 2871	. 2 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ 𝑆)
6		mgm2nsgrp.p	. . . . 5 ⊢ ⚬ = (+g‘𝑀)
7		mgm2nsgrp.o	. . . . 5 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
8	6, 7	eqtri 2783	. . . 4 ⊢ ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴))
9	8	a1i 11	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴)))
10		simprl 783	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → 𝑥 = 𝐴)
11		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵)) → 𝑦 = (𝐴 ⚬ 𝐵))
12		ifeq1 4485	. . . . . . . . . . 11 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴))
13		ifid 4522	. . . . . . . . . . 11 ⊢ if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐴, 𝐴) = 𝐴
14	12, 13	eqtrdi 2811	. . . . . . . . . 10 ⊢ (𝐵 = 𝐴 → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
15	14	a1d 26	. . . . . . . . 9 ⊢ (𝐵 = 𝐴 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
16		eqeq1 2764	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝐵 → (𝑦 = 𝐴 ↔ 𝐵 = 𝐴))
17	16	biimpcd 252	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝐴 → (𝑦 = 𝐵 → 𝐵 = 𝐴))
18	17	adantl 487	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → (𝑦 = 𝐵 → 𝐵 = 𝐴))
19	18	com12 33	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝐵 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → 𝐵 = 𝐴))
20	19	adantl 487	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐴) → 𝐵 = 𝐴))
21	20	con3d 153	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (¬ 𝐵 = 𝐴 → ¬ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴)))
22	21	impcom 413	. . . . . . . . . . 11 ⊢ ((¬ 𝐵 = 𝐴 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → ¬ (𝑥 = 𝐴 ∧ 𝑦 = 𝐴))
23	22	iffalsed 4492	. . . . . . . . . 10 ⊢ ((¬ 𝐵 = 𝐴 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
24	23	ex 418	. . . . . . . . 9 ⊢ (¬ 𝐵 = 𝐴 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴))
25	15, 24	pm2.61i 184	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
26	25	adantl 487	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐴)
27		simpl 488	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐴 ∈ 𝑆)
28		simpr 490	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐵 ∈ 𝑆)
29	9, 26, 27, 28, 27	ovmpod 7572	. . . . . 6 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐵) = 𝐴)
30	11, 29	sylan9eqr 2817	. . . . 5 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → 𝑦 = 𝐴)
31	10, 30	jca 521	. . . 4 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → (𝑥 = 𝐴 ∧ 𝑦 = 𝐴))
32	31	iftrued 4489	. . 3 ⊢ (((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) ∧ (𝑥 = 𝐴 ∧ 𝑦 = (𝐴 ⚬ 𝐵))) → if((𝑥 = 𝐴 ∧ 𝑦 = 𝐴), 𝐵, 𝐴) = 𝐵)
33	29, 27	eqeltrd 2860	. . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ 𝐵) ∈ 𝑆)
34	9, 32, 27, 33, 28	ovmpod 7572	. 2 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ⚬ (𝐴 ⚬ 𝐵)) = 𝐵)
35	3, 5, 34	syl2an 608	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ⚬ (𝐴 ⚬ 𝐵)) = 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ifcif 4481  {cpr 4585  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  Basecbs 17387  +_gcplusg 17428

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425

This theorem is used by:  mgm2nsgrplem4  19120