| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > symgextf1lem | Structured version Visualization version GIF version | ||
| Description: Lemma for symgextf1 19391. (Contributed by AV, 6-Jan-2019.) |
| Ref | Expression |
|---|---|
| symgext.s | ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) |
| symgext.e | ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) |
| Ref | Expression |
|---|---|
| symgextf1lem | ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2741 | . . . . . . 7 ⊢ (SymGrp‘(𝑁 ∖ {𝐾})) = (SymGrp‘(𝑁 ∖ {𝐾})) | |
| 2 | symgext.s | . . . . . . 7 ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) | |
| 3 | 1, 2 | symgfv 19350 | . . . . . 6 ⊢ ((𝑍 ∈ 𝑆 ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾})) |
| 4 | 3 | adantll 721 | . . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾})) |
| 5 | eldifsni 4726 | . . . . . 6 ⊢ ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝑍‘𝑋) ≠ 𝐾) | |
| 6 | symgext.e | . . . . . . . . 9 ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) | |
| 7 | 2, 6 | symgextfv 19388 | . . . . . . . 8 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋))) |
| 8 | 7 | imp 408 | . . . . . . 7 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = (𝑍‘𝑋)) |
| 9 | 8 | neeq1d 2995 | . . . . . 6 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝐸‘𝑋) ≠ 𝐾 ↔ (𝑍‘𝑋) ≠ 𝐾)) |
| 10 | 5, 9 | imbitrrid 248 | . . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) ≠ 𝐾)) |
| 11 | 4, 10 | mpd 15 | . . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾) |
| 12 | 11 | adantrr 724 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾) |
| 13 | elsni 4575 | . . . . . 6 ⊢ (𝑌 ∈ {𝐾} → 𝑌 = 𝐾) | |
| 14 | 2, 6 | symgextfve 19389 | . . . . . . 7 ⊢ (𝐾 ∈ 𝑁 → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾)) |
| 15 | 14 | adantr 482 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾)) |
| 16 | 13, 15 | syl5com 31 | . . . . 5 ⊢ (𝑌 ∈ {𝐾} → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾)) |
| 17 | 16 | adantl 483 | . . . 4 ⊢ ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾)) |
| 18 | 17 | impcom 409 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑌) = 𝐾) |
| 19 | 12, 18 | neeqtrrd 3010 | . 2 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ (𝐸‘𝑌)) |
| 20 | 19 | ex 414 | 1 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ≠ wne 2936 ∖ cdif 3882 ifcif 4457 {csn 4558 ↦ cmpt 5156 ‘cfv 6489 Basecbs 17174 SymGrpcsymg 19339 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4842 df-iun 4926 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-uz 12784 df-fz 13457 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-tset 17234 df-efmnd 18832 df-symg 19340 |
| This theorem is referenced by: symgextf1 19391 |
| Copyright terms: Public domain | W3C validator |