Theorem sgrp2nmndlem3 19038

Description: Lemma 3 for sgrp2nmnd 19043. (Contributed by AV, 29-Jan-2020.)

Hypotheses

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

Assertion

Ref	Expression
sgrp2nmndlem3	⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → (𝐵 ⚬ 𝐶) = 𝐵)

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

Allowed substitution hints:   𝑀(𝑦)   ⚬ (𝑥, 𝑦)

Proof of Theorem sgrp2nmndlem3

Step	Hyp	Ref	Expression
1		sgrp2nmnd.p	. . . 4 ⊢ ⚬ = (+g‘𝑀)
2		sgrp2nmnd.o	. . . 4 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵))
3	1, 2	eqtri 2783	. . 3 ⊢ ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵))
4	3	a1i 11	. 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵)))
5		df-ne 2956	. . . . . 6 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵)
6		eqeq2 2772	. . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐴 = 𝑥 ↔ 𝐴 = 𝐵))
7	6	adantr 486	. . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (𝐴 = 𝑥 ↔ 𝐴 = 𝐵))
8		eqcom 2767	. . . . . . . . 9 ⊢ (𝐴 = 𝑥 ↔ 𝑥 = 𝐴)
9	7, 8	bitr3di 289	. . . . . . . 8 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (𝐴 = 𝐵 ↔ 𝑥 = 𝐴))
10	9	notbid 321	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (¬ 𝐴 = 𝐵 ↔ ¬ 𝑥 = 𝐴))
11	10	biimpcd 252	. . . . . 6 ⊢ (¬ 𝐴 = 𝐵 → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴))
12	5, 11	sylbi 220	. . . . 5 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴))
13	12	3ad2ant3 1153	. . . 4 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴))
14	13	imp 412	. . 3 ⊢ (((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) → ¬ 𝑥 = 𝐴)
15	14	iffalsed 4493	. 2 ⊢ (((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) → if(𝑥 = 𝐴, 𝐴, 𝐵) = 𝐵)
16		simp2 1155	. 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝑆)
17		simp1 1154	. 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → 𝐶 ∈ 𝑆)
18	4, 15, 16, 17, 16	ovmpod 7566	1 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → (𝐵 ⚬ 𝐶) = 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ifcif 4482  {cpr 4586  ‘cfv 6533  (class class class)co 7414   ∈ cmpo 7416  Basecbs 17302  +_gcplusg 17343

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-oprab 7418  df-mpo 7419

This theorem is used by:  sgrp2rid2  19039  sgrp2nmndlem4  19041  sgrp2nmndlem5  19042