gexdvds - Metamath Proof Explorer

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

Theorem gexdvds 19506

Description: The only 𝑁 that annihilate all the elements of the group are the multiples of the group exponent. (Contributed by Mario Carneiro, 24-Apr-2016.)

**Hypotheses**
Ref	Expression
gexcl.1	⊢ 𝑋 = (Base‘𝐺)
gexcl.2	⊢ 𝐸 = (gEx‘𝐺)
gexid.3	⊢ · = (._g‘𝐺)
gexid.4	⊢ 0 = (0_g‘𝐺)

**Assertion**
Ref	Expression
gexdvds	⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝐸 ∥ 𝑁 ↔ ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))

Distinct variable groups: 𝑥,𝐸 𝑥,𝐺 𝑥,𝑁 𝑥,𝑋 𝑥, 0 𝑥, ·

Proof of Theorem gexdvds Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		gexcl.1	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
2		gexcl.2	. . . . . 6 ⊢ 𝐸 = (gEx‘𝐺)
3		gexid.3	. . . . . 6 ⊢ · = (._g‘𝐺)
4		gexid.4	. . . . . 6 ⊢ 0 = (0_g‘𝐺)
5	1, 2, 3, 4	gexdvdsi 19505	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝐸 ∥ 𝑁) → (𝑁 · 𝑥) = 0 )
6	5	3expia 1121	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (𝐸 ∥ 𝑁 → (𝑁 · 𝑥) = 0 ))
7	6	ralrimdva 3134	. . 3 ⊢ (𝐺 ∈ Grp → (𝐸 ∥ 𝑁 → ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))
8	7	adantr 480	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝐸 ∥ 𝑁 → ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))
9		noel 4289	. . . . . . 7 ⊢ ¬ (abs‘𝑁) ∈ ∅
10		simprr 772	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)
11	10	eleq2d 2819	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → ((abs‘𝑁) ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } ↔ (abs‘𝑁) ∈ ∅))
12		oveq1 7362	. . . . . . . . . . . 12 ⊢ (𝑦 = (abs‘𝑁) → (𝑦 · 𝑥) = ((abs‘𝑁) · 𝑥))
13	12	eqeq1d 2735	. . . . . . . . . . 11 ⊢ (𝑦 = (abs‘𝑁) → ((𝑦 · 𝑥) = 0 ↔ ((abs‘𝑁) · 𝑥) = 0 ))
14	13	ralbidv 3157	. . . . . . . . . 10 ⊢ (𝑦 = (abs‘𝑁) → (∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 ↔ ∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ))
15	14	elrab 3644	. . . . . . . . 9 ⊢ ((abs‘𝑁) ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } ↔ ((abs‘𝑁) ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ))
16	11, 15	bitr3di 286	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → ((abs‘𝑁) ∈ ∅ ↔ ((abs‘𝑁) ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 )))
17	16	rbaibd 540	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) ∧ ∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ) → ((abs‘𝑁) ∈ ∅ ↔ (abs‘𝑁) ∈ ℕ))
18	9, 17	mtbii 326	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) ∧ ∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ) → ¬ (abs‘𝑁) ∈ ℕ)
19	18	ex 412	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 → ¬ (abs‘𝑁) ∈ ℕ))
20		nn0abscl 15229	. . . . . . . 8 ⊢ (𝑁 ∈ ℤ → (abs‘𝑁) ∈ ℕ₀)
21	20	ad2antlr 727	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (abs‘𝑁) ∈ ℕ₀)
22		elnn0 12393	. . . . . . 7 ⊢ ((abs‘𝑁) ∈ ℕ₀ ↔ ((abs‘𝑁) ∈ ℕ ∨ (abs‘𝑁) = 0))
23	21, 22	sylib 218	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → ((abs‘𝑁) ∈ ℕ ∨ (abs‘𝑁) = 0))
24	23	ord 864	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (¬ (abs‘𝑁) ∈ ℕ → (abs‘𝑁) = 0))
25	19, 24	syld 47	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 → (abs‘𝑁) = 0))
26		simpr 484	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) ∧ (abs‘𝑁) = 𝑁) → (abs‘𝑁) = 𝑁)
27	26	oveq1d 7370	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) ∧ (abs‘𝑁) = 𝑁) → ((abs‘𝑁) · 𝑥) = (𝑁 · 𝑥))
28	27	eqeq1d 2735	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) ∧ (abs‘𝑁) = 𝑁) → (((abs‘𝑁) · 𝑥) = 0 ↔ (𝑁 · 𝑥) = 0 ))
29		oveq1 7362	. . . . . . . . 9 ⊢ ((abs‘𝑁) = -𝑁 → ((abs‘𝑁) · 𝑥) = (-𝑁 · 𝑥))
30	29	eqeq1d 2735	. . . . . . . 8 ⊢ ((abs‘𝑁) = -𝑁 → (((abs‘𝑁) · 𝑥) = 0 ↔ (-𝑁 · 𝑥) = 0 ))
31		eqid 2733	. . . . . . . . . . . 12 ⊢ (inv_g‘𝐺) = (inv_g‘𝐺)
32	1, 3, 31	mulgneg 19015	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑥 ∈ 𝑋) → (-𝑁 · 𝑥) = ((inv_g‘𝐺)‘(𝑁 · 𝑥)))
33	32	3expa 1118	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → (-𝑁 · 𝑥) = ((inv_g‘𝐺)‘(𝑁 · 𝑥)))
34	4, 31	grpinvid 18922	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ Grp → ((inv_g‘𝐺)‘ 0 ) = 0 )
35	34	ad2antrr 726	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → ((inv_g‘𝐺)‘ 0 ) = 0 )
36	35	eqcomd 2739	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → 0 = ((inv_g‘𝐺)‘ 0 ))
37	33, 36	eqeq12d 2749	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → ((-𝑁 · 𝑥) = 0 ↔ ((inv_g‘𝐺)‘(𝑁 · 𝑥)) = ((inv_g‘𝐺)‘ 0 )))
38		simpll 766	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → 𝐺 ∈ Grp)
39	1, 3	mulgcl 19014	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ ∧ 𝑥 ∈ 𝑋) → (𝑁 · 𝑥) ∈ 𝑋)
40	39	3expa 1118	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → (𝑁 · 𝑥) ∈ 𝑋)
41	1, 4	grpidcl 18888	. . . . . . . . . . 11 ⊢ (𝐺 ∈ Grp → 0 ∈ 𝑋)
42	41	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → 0 ∈ 𝑋)
43	1, 31, 38, 40, 42	grpinv11 18930	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → (((inv_g‘𝐺)‘(𝑁 · 𝑥)) = ((inv_g‘𝐺)‘ 0 ) ↔ (𝑁 · 𝑥) = 0 ))
44	37, 43	bitrd 279	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → ((-𝑁 · 𝑥) = 0 ↔ (𝑁 · 𝑥) = 0 ))
45	30, 44	sylan9bbr 510	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) ∧ (abs‘𝑁) = -𝑁) → (((abs‘𝑁) · 𝑥) = 0 ↔ (𝑁 · 𝑥) = 0 ))
46		zre 12482	. . . . . . . . 9 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ)
47	46	ad2antlr 727	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → 𝑁 ∈ ℝ)
48	47	absord 15333	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → ((abs‘𝑁) = 𝑁 ∨ (abs‘𝑁) = -𝑁))
49	28, 45, 48	mpjaodan 960	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝑥 ∈ 𝑋) → (((abs‘𝑁) · 𝑥) = 0 ↔ (𝑁 · 𝑥) = 0 ))
50	49	ralbidva 3155	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ↔ ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))
51	50	adantr 480	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (∀𝑥 ∈ 𝑋 ((abs‘𝑁) · 𝑥) = 0 ↔ ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))
52		0dvds 16197	. . . . . 6 ⊢ (𝑁 ∈ ℤ → (0 ∥ 𝑁 ↔ 𝑁 = 0))
53	52	ad2antlr 727	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (0 ∥ 𝑁 ↔ 𝑁 = 0))
54		simprl 770	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → 𝐸 = 0)
55	54	breq1d 5105	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (𝐸 ∥ 𝑁 ↔ 0 ∥ 𝑁))
56		zcn 12483	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℂ)
57	56	ad2antlr 727	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → 𝑁 ∈ ℂ)
58	57	abs00ad 15207	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → ((abs‘𝑁) = 0 ↔ 𝑁 = 0))
59	53, 55, 58	3bitr4rd 312	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → ((abs‘𝑁) = 0 ↔ 𝐸 ∥ 𝑁))
60	25, 51, 59	3imtr3d 293	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ (𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅)) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → 𝐸 ∥ 𝑁))
61		elrabi 3640	. . . 4 ⊢ (𝐸 ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } → 𝐸 ∈ ℕ)
62	46	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → 𝑁 ∈ ℝ)
63		nnrp 12912	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℕ → 𝐸 ∈ ℝ⁺)
64		modval 13785	. . . . . . . . . . . 12 ⊢ ((𝑁 ∈ ℝ ∧ 𝐸 ∈ ℝ⁺) → (𝑁 mod 𝐸) = (𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))))
65	62, 63, 64	syl2an 596	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝑁 mod 𝐸) = (𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))))
66	65	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → (𝑁 mod 𝐸) = (𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))))
67	66	oveq1d 7370	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝑁 mod 𝐸) · 𝑥) = ((𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))) · 𝑥))
68		simplll 774	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → 𝐺 ∈ Grp)
69		simpllr 775	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → 𝑁 ∈ ℤ)
70		nnz 12499	. . . . . . . . . . . 12 ⊢ (𝐸 ∈ ℕ → 𝐸 ∈ ℤ)
71	70	ad2antlr 727	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → 𝐸 ∈ ℤ)
72		rerpdivcl 12932	. . . . . . . . . . . . . 14 ⊢ ((𝑁 ∈ ℝ ∧ 𝐸 ∈ ℝ⁺) → (𝑁 / 𝐸) ∈ ℝ)
73	62, 63, 72	syl2an 596	. . . . . . . . . . . . 13 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝑁 / 𝐸) ∈ ℝ)
74	73	flcld 13712	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (⌊‘(𝑁 / 𝐸)) ∈ ℤ)
75	74	adantr 480	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → (⌊‘(𝑁 / 𝐸)) ∈ ℤ)
76	71, 75	zmulcld 12593	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → (𝐸 · (⌊‘(𝑁 / 𝐸))) ∈ ℤ)
77		simprl 770	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → 𝑥 ∈ 𝑋)
78		eqid 2733	. . . . . . . . . . 11 ⊢ (-_g‘𝐺) = (-_g‘𝐺)
79	1, 3, 78	mulgsubdir 19037	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ (𝑁 ∈ ℤ ∧ (𝐸 · (⌊‘(𝑁 / 𝐸))) ∈ ℤ ∧ 𝑥 ∈ 𝑋)) → ((𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))) · 𝑥) = ((𝑁 · 𝑥)(-_g‘𝐺)((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥)))
80	68, 69, 76, 77, 79	syl13anc 1374	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝑁 − (𝐸 · (⌊‘(𝑁 / 𝐸)))) · 𝑥) = ((𝑁 · 𝑥)(-_g‘𝐺)((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥)))
81		simprr 772	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → (𝑁 · 𝑥) = 0 )
82		dvdsmul1 16198	. . . . . . . . . . . . 13 ⊢ ((𝐸 ∈ ℤ ∧ (⌊‘(𝑁 / 𝐸)) ∈ ℤ) → 𝐸 ∥ (𝐸 · (⌊‘(𝑁 / 𝐸))))
83	71, 75, 82	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → 𝐸 ∥ (𝐸 · (⌊‘(𝑁 / 𝐸))))
84	1, 2, 3, 4	gexdvdsi 19505	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋 ∧ 𝐸 ∥ (𝐸 · (⌊‘(𝑁 / 𝐸)))) → ((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥) = 0 )
85	68, 77, 83, 84	syl3anc 1373	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥) = 0 )
86	81, 85	oveq12d 7373	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝑁 · 𝑥)(-_g‘𝐺)((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥)) = ( 0 (-_g‘𝐺) 0 ))
87		simpll 766	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → 𝐺 ∈ Grp)
88	1, 4, 78	grpsubid 18947	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ 𝑋) → ( 0 (-_g‘𝐺) 0 ) = 0 )
89	87, 41, 88	syl2anc2 585	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → ( 0 (-_g‘𝐺) 0 ) = 0 )
90	89	adantr 480	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ( 0 (-_g‘𝐺) 0 ) = 0 )
91	86, 90	eqtrd 2768	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝑁 · 𝑥)(-_g‘𝐺)((𝐸 · (⌊‘(𝑁 / 𝐸))) · 𝑥)) = 0 )
92	67, 80, 91	3eqtrd 2772	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ (𝑥 ∈ 𝑋 ∧ (𝑁 · 𝑥) = 0 )) → ((𝑁 mod 𝐸) · 𝑥) = 0 )
93	92	expr 456	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) ∧ 𝑥 ∈ 𝑋) → ((𝑁 · 𝑥) = 0 → ((𝑁 mod 𝐸) · 𝑥) = 0 ))
94	93	ralimdva 3146	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → ∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 ))
95		modlt 13794	. . . . . . . . 9 ⊢ ((𝑁 ∈ ℝ ∧ 𝐸 ∈ ℝ⁺) → (𝑁 mod 𝐸) < 𝐸)
96	62, 63, 95	syl2an 596	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝑁 mod 𝐸) < 𝐸)
97		zmodcl 13805	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ℤ ∧ 𝐸 ∈ ℕ) → (𝑁 mod 𝐸) ∈ ℕ₀)
98	97	adantll 714	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝑁 mod 𝐸) ∈ ℕ₀)
99	98	nn0red 12453	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝑁 mod 𝐸) ∈ ℝ)
100		nnre 12142	. . . . . . . . . 10 ⊢ (𝐸 ∈ ℕ → 𝐸 ∈ ℝ)
101	100	adantl 481	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → 𝐸 ∈ ℝ)
102	99, 101	ltnled 11270	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → ((𝑁 mod 𝐸) < 𝐸 ↔ ¬ 𝐸 ≤ (𝑁 mod 𝐸)))
103	96, 102	mpbid 232	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → ¬ 𝐸 ≤ (𝑁 mod 𝐸))
104	1, 2, 3, 4	gexlem2 19504	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ (𝑁 mod 𝐸) ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 ) → 𝐸 ∈ (1...(𝑁 mod 𝐸)))
105		elfzle2 13438	. . . . . . . . . . . . 13 ⊢ (𝐸 ∈ (1...(𝑁 mod 𝐸)) → 𝐸 ≤ (𝑁 mod 𝐸))
106	104, 105	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ (𝑁 mod 𝐸) ∈ ℕ ∧ ∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 ) → 𝐸 ≤ (𝑁 mod 𝐸))
107	106	3expia 1121	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ (𝑁 mod 𝐸) ∈ ℕ) → (∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 → 𝐸 ≤ (𝑁 mod 𝐸)))
108	107	impancom 451	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 ) → ((𝑁 mod 𝐸) ∈ ℕ → 𝐸 ≤ (𝑁 mod 𝐸)))
109	108	con3d 152	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ ∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 ) → (¬ 𝐸 ≤ (𝑁 mod 𝐸) → ¬ (𝑁 mod 𝐸) ∈ ℕ))
110	109	ex 412	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → (∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 → (¬ 𝐸 ≤ (𝑁 mod 𝐸) → ¬ (𝑁 mod 𝐸) ∈ ℕ)))
111	110	ad2antrr 726	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 → (¬ 𝐸 ≤ (𝑁 mod 𝐸) → ¬ (𝑁 mod 𝐸) ∈ ℕ)))
112	103, 111	mpid 44	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (∀𝑥 ∈ 𝑋 ((𝑁 mod 𝐸) · 𝑥) = 0 → ¬ (𝑁 mod 𝐸) ∈ ℕ))
113		elnn0 12393	. . . . . . . 8 ⊢ ((𝑁 mod 𝐸) ∈ ℕ₀ ↔ ((𝑁 mod 𝐸) ∈ ℕ ∨ (𝑁 mod 𝐸) = 0))
114	98, 113	sylib 218	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → ((𝑁 mod 𝐸) ∈ ℕ ∨ (𝑁 mod 𝐸) = 0))
115	114	ord 864	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (¬ (𝑁 mod 𝐸) ∈ ℕ → (𝑁 mod 𝐸) = 0))
116	94, 112, 115	3syld 60	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → (𝑁 mod 𝐸) = 0))
117		simpr 484	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → 𝐸 ∈ ℕ)
118		simplr 768	. . . . . 6 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → 𝑁 ∈ ℤ)
119		dvdsval3 16177	. . . . . 6 ⊢ ((𝐸 ∈ ℕ ∧ 𝑁 ∈ ℤ) → (𝐸 ∥ 𝑁 ↔ (𝑁 mod 𝐸) = 0))
120	117, 118, 119	syl2anc 584	. . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (𝐸 ∥ 𝑁 ↔ (𝑁 mod 𝐸) = 0))
121	116, 120	sylibrd 259	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ ℕ) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → 𝐸 ∥ 𝑁))
122	61, 121	sylan2 593	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) ∧ 𝐸 ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → 𝐸 ∥ 𝑁))
123		eqid 2733	. . . . 5 ⊢ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }
124	1, 3, 4, 2, 123	gexlem1 19501	. . . 4 ⊢ (𝐺 ∈ Grp → ((𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅) ∨ 𝐸 ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }))
125	124	adantr 480	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → ((𝐸 = 0 ∧ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 } = ∅) ∨ 𝐸 ∈ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }))
126	60, 122, 125	mpjaodan 960	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 → 𝐸 ∥ 𝑁))
127	8, 126	impbid 212	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑁 ∈ ℤ) → (𝐸 ∥ 𝑁 ↔ ∀𝑥 ∈ 𝑋 (𝑁 · 𝑥) = 0 ))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∀wral 3049 {crab 3397 ∅c0 4284 class class class wbr 5095 ‘cfv 6489 (class class class)co 7355 ℂcc 11014 ℝcr 11015 0cc0 11016 1c1 11017 · cmul 11021 < clt 11156 ≤ cle 11157 − cmin 11354 -cneg 11355 / cdiv 11784 ℕcn 12135 ℕ₀cn0 12391 ℤcz 12478 ℝ⁺crp 12900 ...cfz 13417 ⌊cfl 13704 mod cmo 13783 abscabs 15151 ∥ cdvds 16173 Basecbs 17130 0_gc0g 17353 Grpcgrp 18856 inv_gcminusg 18857 -_gcsg 18858 ._gcmg 18990 gExcgex 19447

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11072 ax-resscn 11073 ax-1cn 11074 ax-icn 11075 ax-addcl 11076 ax-addrcl 11077 ax-mulcl 11078 ax-mulrcl 11079 ax-mulcom 11080 ax-addass 11081 ax-mulass 11082 ax-distr 11083 ax-i2m1 11084 ax-1ne0 11085 ax-1rid 11086 ax-rnegex 11087 ax-rrecex 11088 ax-cnre 11089 ax-pre-lttri 11090 ax-pre-lttrn 11091 ax-pre-ltadd 11092 ax-pre-mulgt0 11093 ax-pre-sup 11094

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 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 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-er 8631 df-en 8879 df-dom 8880 df-sdom 8881 df-sup 9336 df-inf 9337 df-pnf 11158 df-mnf 11159 df-xr 11160 df-ltxr 11161 df-le 11162 df-sub 11356 df-neg 11357 df-div 11785 df-nn 12136 df-2 12198 df-3 12199 df-n0 12392 df-z 12479 df-uz 12743 df-rp 12901 df-fz 13418 df-fl 13706 df-mod 13784 df-seq 13919 df-exp 13979 df-cj 15016 df-re 15017 df-im 15018 df-sqrt 15152 df-abs 15153 df-dvds 16174 df-0g 17355 df-mgm 18558 df-sgrp 18637 df-mnd 18653 df-grp 18859 df-minusg 18860 df-sbg 18861 df-mulg 18991 df-gex 19451

This theorem is referenced by: gexdvds2 19507

W3C validator