| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sgrp2nmndlem3 | Structured version Visualization version GIF version | ||
| Description: Lemma 3 for sgrp2nmnd 18892. (Contributed by AV, 29-Jan-2020.) |
| Ref | Expression |
|---|---|
| mgm2nsgrp.s | ⊢ 𝑆 = {𝐴, 𝐵} |
| mgm2nsgrp.b | ⊢ (Base‘𝑀) = 𝑆 |
| sgrp2nmnd.o | ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵)) |
| sgrp2nmnd.p | ⊢ ⚬ = (+g‘𝑀) |
| Ref | Expression |
|---|---|
| sgrp2nmndlem3 | ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → (𝐵 ⚬ 𝐶) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sgrp2nmnd.p | . . . 4 ⊢ ⚬ = (+g‘𝑀) | |
| 2 | sgrp2nmnd.o | . . . 4 ⊢ (+g‘𝑀) = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵)) | |
| 3 | 1, 2 | eqtri 2762 | . . 3 ⊢ ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵)) |
| 4 | 3 | a1i 11 | . 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → ⚬ = (𝑥 ∈ 𝑆, 𝑦 ∈ 𝑆 ↦ if(𝑥 = 𝐴, 𝐴, 𝐵))) |
| 5 | df-ne 2935 | . . . . . 6 ⊢ (𝐴 ≠ 𝐵 ↔ ¬ 𝐴 = 𝐵) | |
| 6 | eqeq2 2751 | . . . . . . . . . 10 ⊢ (𝑥 = 𝐵 → (𝐴 = 𝑥 ↔ 𝐴 = 𝐵)) | |
| 7 | 6 | adantr 481 | . . . . . . . . 9 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (𝐴 = 𝑥 ↔ 𝐴 = 𝐵)) |
| 8 | eqcom 2746 | . . . . . . . . 9 ⊢ (𝐴 = 𝑥 ↔ 𝑥 = 𝐴) | |
| 9 | 7, 8 | bitr3di 287 | . . . . . . . 8 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (𝐴 = 𝐵 ↔ 𝑥 = 𝐴)) |
| 10 | 9 | notbid 319 | . . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → (¬ 𝐴 = 𝐵 ↔ ¬ 𝑥 = 𝐴)) |
| 11 | 10 | biimpcd 250 | . . . . . 6 ⊢ (¬ 𝐴 = 𝐵 → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴)) |
| 12 | 5, 11 | sylbi 218 | . . . . 5 ⊢ (𝐴 ≠ 𝐵 → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴)) |
| 13 | 12 | 3ad2ant3 1141 | . . . 4 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → ((𝑥 = 𝐵 ∧ 𝑦 = 𝐶) → ¬ 𝑥 = 𝐴)) |
| 14 | 13 | imp 407 | . . 3 ⊢ (((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) → ¬ 𝑥 = 𝐴) |
| 15 | 14 | iffalsed 4465 | . 2 ⊢ (((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) ∧ (𝑥 = 𝐵 ∧ 𝑦 = 𝐶)) → if(𝑥 = 𝐴, 𝐴, 𝐵) = 𝐵) |
| 16 | simp2 1143 | . 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → 𝐵 ∈ 𝑆) | |
| 17 | simp1 1142 | . 2 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → 𝐶 ∈ 𝑆) | |
| 18 | 4, 15, 16, 17, 16 | ovmpod 7508 | 1 ⊢ ((𝐶 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆 ∧ 𝐴 ≠ 𝐵) → (𝐵 ⚬ 𝐶) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ifcif 4454 {cpr 4557 ‘cfv 6485 (class class class)co 7356 ∈ cmpo 7358 Basecbs 17170 +gcplusg 17211 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-pr 5362 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-sbc 3724 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-if 4455 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-br 5073 df-opab 5135 df-id 5513 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-iota 6441 df-fun 6487 df-fv 6493 df-ov 7359 df-oprab 7360 df-mpo 7361 |
| This theorem is referenced by: sgrp2rid2 18888 sgrp2nmndlem4 18890 sgrp2nmndlem5 18891 |
| Copyright terms: Public domain | W3C validator |