Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > symgextf1lem | Structured version Visualization version GIF version |
Description: Lemma for symgextf1 17664. (Contributed by AV, 6-Jan-2019.) |
Ref | Expression |
---|---|
symgext.s | ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) |
symgext.e | ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) |
Ref | Expression |
---|---|
symgextf1lem | ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2610 | . . . . . . 7 ⊢ (SymGrp‘(𝑁 ∖ {𝐾})) = (SymGrp‘(𝑁 ∖ {𝐾})) | |
2 | symgext.s | . . . . . . 7 ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾}))) | |
3 | 1, 2 | symgfv 17630 | . . . . . 6 ⊢ ((𝑍 ∈ 𝑆 ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾})) |
4 | 3 | adantll 746 | . . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾})) |
5 | eldifsni 4261 | . . . . . 6 ⊢ ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝑍‘𝑋) ≠ 𝐾) | |
6 | symgext.e | . . . . . . . . 9 ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥))) | |
7 | 2, 6 | symgextfv 17661 | . . . . . . . 8 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋))) |
8 | 7 | imp 444 | . . . . . . 7 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = (𝑍‘𝑋)) |
9 | 8 | neeq1d 2841 | . . . . . 6 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝐸‘𝑋) ≠ 𝐾 ↔ (𝑍‘𝑋) ≠ 𝐾)) |
10 | 5, 9 | syl5ibr 235 | . . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) ≠ 𝐾)) |
11 | 4, 10 | mpd 15 | . . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾) |
12 | 11 | adantrr 749 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾) |
13 | elsni 4142 | . . . . . 6 ⊢ (𝑌 ∈ {𝐾} → 𝑌 = 𝐾) | |
14 | 2, 6 | symgextfve 17662 | . . . . . . 7 ⊢ (𝐾 ∈ 𝑁 → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾)) |
15 | 14 | adantr 480 | . . . . . 6 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾)) |
16 | 13, 15 | syl5com 31 | . . . . 5 ⊢ (𝑌 ∈ {𝐾} → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾)) |
17 | 16 | adantl 481 | . . . 4 ⊢ ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾)) |
18 | 17 | impcom 445 | . . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑌) = 𝐾) |
19 | 12, 18 | neeqtrrd 2856 | . 2 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ (𝐸‘𝑌)) |
20 | 19 | ex 449 | 1 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∖ cdif 3537 ifcif 4036 {csn 4125 ↦ cmpt 4643 ‘cfv 5804 Basecbs 15695 SymGrpcsymg 17620 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-9 10963 df-n0 11170 df-z 11255 df-uz 11564 df-fz 12198 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-plusg 15781 df-tset 15787 df-symg 17621 |
This theorem is referenced by: symgextf1 17664 |
Copyright terms: Public domain | W3C validator |