Theorem gexval 19594

Description: Value of the exponent of a group. (Contributed by Mario Carneiro, 23-Apr-2016.) (Revised by AV, 26-Sep-2020.)

Hypotheses

Ref	Expression
gexval.1	⊢ 𝑋 = (Base‘𝐺)
gexval.2	⊢ · = (.g‘𝐺)
gexval.3	⊢ 0 = (0g‘𝐺)
gexval.4	⊢ 𝐸 = (gEx‘𝐺)
gexval.i	⊢ 𝐼 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }

Assertion

Ref	Expression
gexval	⊢ (𝐺 ∈ 𝑉 → 𝐸 = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))

Distinct variable groups:   𝑥,𝑦, 0   𝑥,𝐺,𝑦   𝑥,𝑉,𝑦   𝑥, · ,𝑦   𝑥,𝑋

Allowed substitution hints:   𝐸(𝑥,𝑦)   𝐼(𝑥,𝑦)   𝑋(𝑦)

Proof of Theorem gexval

Dummy variables 𝑔 𝑖 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gexval.4	. 2 ⊢ 𝐸 = (gEx‘𝐺)
2		df-gex 19545	. . 3 ⊢ gEx = (𝑔 ∈ V ↦ ⦋{𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
3		nnex 12206	. . . . . 6 ⊢ ℕ ∈ V
4	3	rabex 5289	. . . . 5 ⊢ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} ∈ V
5	4	a1i 11	. . . 4 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} ∈ V)
6		simpr 487	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
7	6	fveq2d 6860	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (Base‘𝑔) = (Base‘𝐺))
8		gexval.1	. . . . . . . . . . . 12 ⊢ 𝑋 = (Base‘𝐺)
9	7, 8	eqtr4di 2809	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (Base‘𝑔) = 𝑋)
10	6	fveq2d 6860	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (.g‘𝑔) = (.g‘𝐺))
11		gexval.2	. . . . . . . . . . . . . 14 ⊢ · = (.g‘𝐺)
12	10, 11	eqtr4di 2809	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (.g‘𝑔) = · )
13	12	oveqd 7402	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (𝑦(.g‘𝑔)𝑥) = (𝑦 · 𝑥))
14	6	fveq2d 6860	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (0g‘𝑔) = (0g‘𝐺))
15		gexval.3	. . . . . . . . . . . . 13 ⊢ 0 = (0g‘𝐺)
16	14, 15	eqtr4di 2809	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (0g‘𝑔) = 0 )
17	13, 16	eqeq12d 2772	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → ((𝑦(.g‘𝑔)𝑥) = (0g‘𝑔) ↔ (𝑦 · 𝑥) = 0 ))
18	9, 17	raleqbidv 3330	. . . . . . . . . 10 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔) ↔ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 ))
19	18	rabbidv 3415	. . . . . . . . 9 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 })
20		gexval.i	. . . . . . . . 9 ⊢ 𝐼 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ 𝑋 (𝑦 · 𝑥) = 0 }
21	19, 20	eqtr4di 2809	. . . . . . . 8 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} = 𝐼)
22	21	eqeq2d 2767	. . . . . . 7 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → (𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} ↔ 𝑖 = 𝐼))
23	22	biimpa 479	. . . . . 6 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)}) → 𝑖 = 𝐼)
24	23	eqeq1d 2758	. . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)}) → (𝑖 = ∅ ↔ 𝐼 = ∅))
25	23	infeq1d 9414	. . . . 5 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)}) → inf(𝑖, ℝ, < ) = inf(𝐼, ℝ, < ))
26	24, 25	ifbieq2d 4501	. . . 4 ⊢ (((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)}) → if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
27	5, 26	csbied 3883	. . 3 ⊢ ((𝐺 ∈ 𝑉 ∧ 𝑔 = 𝐺) → ⦋{𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g‘𝑔)𝑥) = (0g‘𝑔)} / 𝑖⦌if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
28		elex 3469	. . 3 ⊢ (𝐺 ∈ 𝑉 → 𝐺 ∈ V)
29		c0ex 11163	. . . . 5 ⊢ 0 ∈ V
30		ltso 11253	. . . . . 6 ⊢ < Or ℝ
31	30	infex 9431	. . . . 5 ⊢ inf(𝐼, ℝ, < ) ∈ V
32	29, 31	ifex 4525	. . . 4 ⊢ if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) ∈ V
33	32	a1i 11	. . 3 ⊢ (𝐺 ∈ 𝑉 → if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) ∈ V)
34	2, 27, 28, 33	fvmptd2 6973	. 2 ⊢ (𝐺 ∈ 𝑉 → (gEx‘𝐺) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
35	1, 34	eqtrid 2803	1 ⊢ (𝐺 ∈ 𝑉 → 𝐸 = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1554   ∈ wcel 2136  ∀wral 3070  {crab 3408  Vcvv 3448  ⦋csb 3847  ∅c0 4280  ifcif 4474  ‘cfv 6510  (class class class)co 7385  infcinf 9377  ℝcr 11062  0cc0 11063   < clt 11206  ℕcn 12200  Basecbs 17221  0_gc0g 17444  ._gcmg 19085  gExcgex 19541

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-11 2185  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-nul 5250  ax-pow 5316  ax-pr 5384  ax-un 7707  ax-cnex 11119  ax-resscn 11120  ax-1cn 11121  ax-icn 11122  ax-addcl 11123  ax-mulcl 11125  ax-i2m1 11131  ax-pre-lttri 11137  ax-pre-lttrn 11138

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-nfc 2905  df-ne 2952  df-nel 3056  df-ral 3071  df-rex 3081  df-rmo 3361  df-reu 3362  df-rab 3409  df-v 3450  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4281  df-if 4475  df-pw 4551  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-iun 4945  df-br 5095  df-opab 5157  df-mpt 5176  df-tr 5202  df-id 5535  df-eprel 5540  df-po 5548  df-so 5549  df-fr 5593  df-we 5595  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6466  df-fun 6512  df-fn 6513  df-f 6514  df-f1 6515  df-fo 6516  df-f1o 6517  df-fv 6518  df-ov 7388  df-om 7836  df-2nd 7960  df-frecs 8250  df-wrecs 8281  df-recs 8330  df-rdg 8369  df-er 8666  df-en 8917  df-dom 8918  df-sdom 8919  df-sup 9378  df-inf 9379  df-pnf 11208  df-mnf 11209  df-ltxr 11211  df-nn 12201  df-gex 19545

This theorem is referenced by:  gexlem1  19595  gexlem2  19598