symgextf1lem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > symgextf1lem		Structured version Visualization version GIF version

Theorem symgextf1lem 19374

Description: Lemma for symgextf1 19375. (Contributed by AV, 6-Jan-2019.)

**Hypotheses**
Ref	Expression
symgext.s	⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
symgext.e	⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)))

**Assertion**
Ref	Expression
symgextf1lem	⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌)))

Distinct variable groups: 𝑥,𝐾 𝑥,𝑁 𝑥,𝑆 𝑥,𝑍 𝑥,𝑋 𝑥,𝑌 Allowed substitution hint: 𝐸(𝑥)

**Proof of Theorem symgextf1lem**
Step	Hyp	Ref	Expression
1		eqid 2728	. . . . . . 7 ⊢ (SymGrp‘(𝑁 ∖ {𝐾})) = (SymGrp‘(𝑁 ∖ {𝐾}))
2		symgext.s	. . . . . . 7 ⊢ 𝑆 = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
3	1, 2	symgfv 19333	. . . . . 6 ⊢ ((𝑍 ∈ 𝑆 ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}))
4	3	adantll 713	. . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}))
5		eldifsni 4794	. . . . . 6 ⊢ ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝑍‘𝑋) ≠ 𝐾)
6		symgext.e	. . . . . . . . 9 ⊢ 𝐸 = (𝑥 ∈ 𝑁 ↦ if(𝑥 = 𝐾, 𝐾, (𝑍‘𝑥)))
7	2, 6	symgextfv 19372	. . . . . . . 8 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑋 ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) = (𝑍‘𝑋)))
8	7	imp 406	. . . . . . 7 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) = (𝑍‘𝑋))
9	8	neeq1d 2997	. . . . . 6 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝐸‘𝑋) ≠ 𝐾 ↔ (𝑍‘𝑋) ≠ 𝐾))
10	5, 9	imbitrrid 245	. . . . 5 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → ((𝑍‘𝑋) ∈ (𝑁 ∖ {𝐾}) → (𝐸‘𝑋) ≠ 𝐾))
11	4, 10	mpd 15	. . . 4 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ 𝑋 ∈ (𝑁 ∖ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾)
12	11	adantrr 716	. . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ 𝐾)
13		elsni 4646	. . . . . 6 ⊢ (𝑌 ∈ {𝐾} → 𝑌 = 𝐾)
14	2, 6	symgextfve 19373	. . . . . . 7 ⊢ (𝐾 ∈ 𝑁 → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾))
15	14	adantr 480	. . . . . 6 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝑌 = 𝐾 → (𝐸‘𝑌) = 𝐾))
16	13, 15	syl5com 31	. . . . 5 ⊢ (𝑌 ∈ {𝐾} → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾))
17	16	adantl 481	. . . 4 ⊢ ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → (𝐸‘𝑌) = 𝐾))
18	17	impcom 407	. . 3 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑌) = 𝐾)
19	12, 18	neeqtrrd 3012	. 2 ⊢ (((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) ∧ (𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾})) → (𝐸‘𝑋) ≠ (𝐸‘𝑌))
20	19	ex 412	1 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑍 ∈ 𝑆) → ((𝑋 ∈ (𝑁 ∖ {𝐾}) ∧ 𝑌 ∈ {𝐾}) → (𝐸‘𝑋) ≠ (𝐸‘𝑌)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ≠ wne 2937 ∖ cdif 3944 ifcif 4529 {csn 4629 ↦ cmpt 5231 ‘cfv 6548 Basecbs 17179 SymGrpcsymg 19320

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-1o 8486 df-er 8724 df-map 8846 df-en 8964 df-dom 8965 df-sdom 8966 df-fin 8967 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-tset 17251 df-efmnd 18820 df-symg 19321

This theorem is referenced by: symgextf1 19375

W3C validator

	
		OSZAR »