simpgnideld - Metamath Proof Explorer

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

Theorem simpgnideld 20056

Description: A simple group contains a nonidentity element. (Contributed by Rohan Ridenour, 3-Aug-2023.)

**Hypotheses**
Ref	Expression
simpgnideld.1	⊢ 𝐵 = (Base‘𝐺)
simpgnideld.2	⊢ 0 = (0_g‘𝐺)
simpgnideld.3	⊢ (𝜑 → 𝐺 ∈ SimpGrp)

**Assertion**
Ref	Expression
simpgnideld	⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ¬ 𝑥 = 0 )

Distinct variable groups: 𝑥, 0 𝑥,𝐵 Allowed substitution hints: 𝜑(𝑥) 𝐺(𝑥)

**Proof of Theorem simpgnideld**
Step	Hyp	Ref	Expression
1		simpgnideld.1	. . . 4 ⊢ 𝐵 = (Base‘𝐺)
2		simpgnideld.2	. . . 4 ⊢ 0 = (0_g‘𝐺)
3		simpgnideld.3	. . . 4 ⊢ (𝜑 → 𝐺 ∈ SimpGrp)
4	1, 2, 3	simpgntrivd 20055	. . 3 ⊢ (𝜑 → ¬ 𝐵 = { 0 })
5	3	simpggrpd 20052	. . . . . 6 ⊢ (𝜑 → 𝐺 ∈ Grp)
6		grpmnd 18897	. . . . . 6 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Mnd)
7	1, 2	mndidcl 18709	. . . . . 6 ⊢ (𝐺 ∈ Mnd → 0 ∈ 𝐵)
8	5, 6, 7	3syl 18	. . . . 5 ⊢ (𝜑 → 0 ∈ 𝐵)
9	8	ne0d 4336	. . . 4 ⊢ (𝜑 → 𝐵 ≠ ∅)
10		eqsn 4833	. . . 4 ⊢ (𝐵 ≠ ∅ → (𝐵 = { 0 } ↔ ∀𝑥 ∈ 𝐵 𝑥 = 0 ))
11	9, 10	syl 17	. . 3 ⊢ (𝜑 → (𝐵 = { 0 } ↔ ∀𝑥 ∈ 𝐵 𝑥 = 0 ))
12	4, 11	mtbid 324	. 2 ⊢ (𝜑 → ¬ ∀𝑥 ∈ 𝐵 𝑥 = 0 )
13		rexnal 3097	. 2 ⊢ (∃𝑥 ∈ 𝐵 ¬ 𝑥 = 0 ↔ ¬ ∀𝑥 ∈ 𝐵 𝑥 = 0 )
14	12, 13	sylibr 233	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 ¬ 𝑥 = 0 )

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 = wceq 1534 ∈ wcel 2099 ≠ wne 2937 ∀wral 3058 ∃wrex 3067 ∅c0 4323 {csn 4629 ‘cfv 6548 Basecbs 17180 0_gc0g 17421 Mndcmnd 18694 Grpcgrp 18890 SimpGrpcsimpg 20047

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 11195 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-addrcl 11200 ax-mulcl 11201 ax-mulrcl 11202 ax-mulcom 11203 ax-addass 11204 ax-mulass 11205 ax-distr 11206 ax-i2m1 11207 ax-1ne0 11208 ax-1rid 11209 ax-rnegex 11210 ax-rrecex 11211 ax-cnre 11212 ax-pre-lttri 11213 ax-pre-lttrn 11214 ax-pre-ltadd 11215 ax-pre-mulgt0 11216

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-rmo 3373 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-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 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-1o 8487 df-2o 8488 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11281 df-mnf 11282 df-xr 11283 df-ltxr 11284 df-le 11285 df-sub 11477 df-neg 11478 df-nn 12244 df-2 12306 df-sets 17133 df-slot 17151 df-ndx 17163 df-base 17181 df-ress 17210 df-plusg 17246 df-0g 17423 df-mgm 18600 df-sgrp 18679 df-mnd 18695 df-grp 18893 df-minusg 18894 df-sbg 18895 df-subg 19078 df-nsg 19079 df-simpg 20048

This theorem is referenced by: ablsimpgcygd 20063 ablsimpgfind 20067

W3C validator

	
		OSZAR »