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

Theorem gexval 19639
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.
StepHypRef Expression
1 gexval.4 . 2 𝐸 = (gEx‘𝐺)
2 df-gex 19590 . . 3 gEx = (𝑔 ∈ V ↦ {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )))
3 nnex 12230 . . . . . 6 ℕ ∈ V
43rabex 5300 . . . . 5 {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} ∈ V
54a1i 11 . . . 4 ((𝐺𝑉𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} ∈ V)
6 simpr 489 . . . . . . . . . . . . 13 ((𝐺𝑉𝑔 = 𝐺) → 𝑔 = 𝐺)
76fveq2d 6875 . . . . . . . . . . . 12 ((𝐺𝑉𝑔 = 𝐺) → (Base‘𝑔) = (Base‘𝐺))
8 gexval.1 . . . . . . . . . . . 12 𝑋 = (Base‘𝐺)
97, 8eqtr4di 2818 . . . . . . . . . . 11 ((𝐺𝑉𝑔 = 𝐺) → (Base‘𝑔) = 𝑋)
106fveq2d 6875 . . . . . . . . . . . . . 14 ((𝐺𝑉𝑔 = 𝐺) → (.g𝑔) = (.g𝐺))
11 gexval.2 . . . . . . . . . . . . . 14 · = (.g𝐺)
1210, 11eqtr4di 2818 . . . . . . . . . . . . 13 ((𝐺𝑉𝑔 = 𝐺) → (.g𝑔) = · )
1312oveqd 7417 . . . . . . . . . . . 12 ((𝐺𝑉𝑔 = 𝐺) → (𝑦(.g𝑔)𝑥) = (𝑦 · 𝑥))
146fveq2d 6875 . . . . . . . . . . . . 13 ((𝐺𝑉𝑔 = 𝐺) → (0g𝑔) = (0g𝐺))
15 gexval.3 . . . . . . . . . . . . 13 0 = (0g𝐺)
1614, 15eqtr4di 2818 . . . . . . . . . . . 12 ((𝐺𝑉𝑔 = 𝐺) → (0g𝑔) = 0 )
1713, 16eqeq12d 2781 . . . . . . . . . . 11 ((𝐺𝑉𝑔 = 𝐺) → ((𝑦(.g𝑔)𝑥) = (0g𝑔) ↔ (𝑦 · 𝑥) = 0 ))
189, 17raleqbidv 3339 . . . . . . . . . 10 ((𝐺𝑉𝑔 = 𝐺) → (∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔) ↔ ∀𝑥𝑋 (𝑦 · 𝑥) = 0 ))
1918rabbidv 3424 . . . . . . . . 9 ((𝐺𝑉𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} = {𝑦 ∈ ℕ ∣ ∀𝑥𝑋 (𝑦 · 𝑥) = 0 })
20 gexval.i . . . . . . . . 9 𝐼 = {𝑦 ∈ ℕ ∣ ∀𝑥𝑋 (𝑦 · 𝑥) = 0 }
2119, 20eqtr4di 2818 . . . . . . . 8 ((𝐺𝑉𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} = 𝐼)
2221eqeq2d 2776 . . . . . . 7 ((𝐺𝑉𝑔 = 𝐺) → (𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} ↔ 𝑖 = 𝐼))
2322biimpa 481 . . . . . 6 (((𝐺𝑉𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)}) → 𝑖 = 𝐼)
2423eqeq1d 2767 . . . . 5 (((𝐺𝑉𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)}) → (𝑖 = ∅ ↔ 𝐼 = ∅))
2523infeq1d 9426 . . . . 5 (((𝐺𝑉𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)}) → inf(𝑖, ℝ, < ) = inf(𝐼, ℝ, < ))
2624, 25ifbieq2d 4510 . . . 4 (((𝐺𝑉𝑔 = 𝐺) ∧ 𝑖 = {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)}) → if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
275, 26csbied 3891 . . 3 ((𝐺𝑉𝑔 = 𝐺) → {𝑦 ∈ ℕ ∣ ∀𝑥 ∈ (Base‘𝑔)(𝑦(.g𝑔)𝑥) = (0g𝑔)} / 𝑖if(𝑖 = ∅, 0, inf(𝑖, ℝ, < )) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
28 elex 3478 . . 3 (𝐺𝑉𝐺 ∈ V)
29 c0ex 11188 . . . . 5 0 ∈ V
30 ltso 11278 . . . . . 6 < Or ℝ
3130infex 9443 . . . . 5 inf(𝐼, ℝ, < ) ∈ V
3229, 31ifex 4534 . . . 4 if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) ∈ V
3332a1i 11 . . 3 (𝐺𝑉 → if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )) ∈ V)
342, 27, 28, 33fvmptd2 6988 . 2 (𝐺𝑉 → (gEx‘𝐺) = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
351, 34eqtrid 2812 1 (𝐺𝑉𝐸 = if(𝐼 = ∅, 0, inf(𝐼, ℝ, < )))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1563  wcel 2145  wral 3079  {crab 3417  Vcvv 3457  csb 3855  c0 4288  ifcif 4483  cfv 6525  (class class class)co 7400  infcinf 9389  cr 11087  0cc0 11088   < clt 11231  cn 12224  Basecbs 17259  0gc0g 17482  .gcmg 19124  gExcgex 19586
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-mulcl 11150  ax-i2m1 11156  ax-pre-lttri 11162  ax-pre-lttrn 11163
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-om 7851  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-sup 9390  df-inf 9391  df-pnf 11233  df-mnf 11234  df-ltxr 11236  df-nn 12225  df-gex 19590
This theorem is referenced by:  gexlem1  19640  gexlem2  19643
  Copyright terms: Public domain W3C validator