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

Theorem submod 18686
Description: The order of an element is the same in a subgroup. (Contributed by Stefan O'Rear, 12-Sep-2015.) (Proof shortened by AV, 5-Oct-2020.)
Hypotheses
Ref Expression
submod.h 𝐻 = (𝐺s 𝑌)
submod.o 𝑂 = (od‘𝐺)
submod.p 𝑃 = (od‘𝐻)
Assertion
Ref Expression
submod ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → (𝑂𝐴) = (𝑃𝐴))

Proof of Theorem submod
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simpll 765 . . . . . 6 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → 𝑌 ∈ (SubMnd‘𝐺))
2 nnnn0 11896 . . . . . . 7 (𝑥 ∈ ℕ → 𝑥 ∈ ℕ0)
32adantl 484 . . . . . 6 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → 𝑥 ∈ ℕ0)
4 simplr 767 . . . . . 6 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → 𝐴𝑌)
5 eqid 2819 . . . . . . 7 (.g𝐺) = (.g𝐺)
6 submod.h . . . . . . 7 𝐻 = (𝐺s 𝑌)
7 eqid 2819 . . . . . . 7 (.g𝐻) = (.g𝐻)
85, 6, 7submmulg 18263 . . . . . 6 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝑥 ∈ ℕ0𝐴𝑌) → (𝑥(.g𝐺)𝐴) = (𝑥(.g𝐻)𝐴))
91, 3, 4, 8syl3anc 1366 . . . . 5 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → (𝑥(.g𝐺)𝐴) = (𝑥(.g𝐻)𝐴))
10 eqid 2819 . . . . . . 7 (0g𝐺) = (0g𝐺)
116, 10subm0 17972 . . . . . 6 (𝑌 ∈ (SubMnd‘𝐺) → (0g𝐺) = (0g𝐻))
1211ad2antrr 724 . . . . 5 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → (0g𝐺) = (0g𝐻))
139, 12eqeq12d 2835 . . . 4 (((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) ∧ 𝑥 ∈ ℕ) → ((𝑥(.g𝐺)𝐴) = (0g𝐺) ↔ (𝑥(.g𝐻)𝐴) = (0g𝐻)))
1413rabbidva 3477 . . 3 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → {𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)})
15 eqeq1 2823 . . . 4 ({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} → ({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = ∅ ↔ {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = ∅))
16 infeq1 8932 . . . 4 ({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} → inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}, ℝ, < ) = inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}, ℝ, < ))
1715, 16ifbieq2d 4490 . . 3 ({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} → if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}, ℝ, < )) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}, ℝ, < )))
1814, 17syl 17 . 2 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}, ℝ, < )) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}, ℝ, < )))
19 eqid 2819 . . . . 5 (Base‘𝐺) = (Base‘𝐺)
2019submss 17966 . . . 4 (𝑌 ∈ (SubMnd‘𝐺) → 𝑌 ⊆ (Base‘𝐺))
2120sselda 3965 . . 3 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → 𝐴 ∈ (Base‘𝐺))
22 submod.o . . . 4 𝑂 = (od‘𝐺)
23 eqid 2819 . . . 4 {𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}
2419, 5, 10, 22, 23odval 18654 . . 3 (𝐴 ∈ (Base‘𝐺) → (𝑂𝐴) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}, ℝ, < )))
2521, 24syl 17 . 2 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → (𝑂𝐴) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐺)𝐴) = (0g𝐺)}, ℝ, < )))
26 simpr 487 . . . 4 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → 𝐴𝑌)
2720adantr 483 . . . . 5 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → 𝑌 ⊆ (Base‘𝐺))
286, 19ressbas2 16547 . . . . 5 (𝑌 ⊆ (Base‘𝐺) → 𝑌 = (Base‘𝐻))
2927, 28syl 17 . . . 4 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → 𝑌 = (Base‘𝐻))
3026, 29eleqtrd 2913 . . 3 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → 𝐴 ∈ (Base‘𝐻))
31 eqid 2819 . . . 4 (Base‘𝐻) = (Base‘𝐻)
32 eqid 2819 . . . 4 (0g𝐻) = (0g𝐻)
33 submod.p . . . 4 𝑃 = (od‘𝐻)
34 eqid 2819 . . . 4 {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = {𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}
3531, 7, 32, 33, 34odval 18654 . . 3 (𝐴 ∈ (Base‘𝐻) → (𝑃𝐴) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}, ℝ, < )))
3630, 35syl 17 . 2 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → (𝑃𝐴) = if({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)} = ∅, 0, inf({𝑥 ∈ ℕ ∣ (𝑥(.g𝐻)𝐴) = (0g𝐻)}, ℝ, < )))
3718, 25, 363eqtr4d 2864 1 ((𝑌 ∈ (SubMnd‘𝐺) ∧ 𝐴𝑌) → (𝑂𝐴) = (𝑃𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1531  wcel 2108  {crab 3140  wss 3934  c0 4289  ifcif 4465  cfv 6348  (class class class)co 7148  infcinf 8897  cr 10528  0cc0 10529   < clt 10667  cn 11630  0cn0 11889  Basecbs 16475  s cress 16476  0gc0g 16705  SubMndcsubmnd 17947  .gcmg 18216  odcod 18644
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 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453  ax-cnex 10585  ax-resscn 10586  ax-1cn 10587  ax-icn 10588  ax-addcl 10589  ax-addrcl 10590  ax-mulcl 10591  ax-mulrcl 10592  ax-mulcom 10593  ax-addass 10594  ax-mulass 10595  ax-distr 10596  ax-i2m1 10597  ax-1ne0 10598  ax-1rid 10599  ax-rnegex 10600  ax-rrecex 10601  ax-cnre 10602  ax-pre-lttri 10603  ax-pre-lttrn 10604  ax-pre-ltadd 10605  ax-pre-mulgt0 10606
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-nel 3122  df-ral 3141  df-rex 3142  df-reu 3143  df-rmo 3144  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-riota 7106  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-1st 7681  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-er 8281  df-en 8502  df-dom 8503  df-sdom 8504  df-sup 8898  df-inf 8899  df-pnf 10669  df-mnf 10670  df-xr 10671  df-ltxr 10672  df-le 10673  df-sub 10864  df-neg 10865  df-nn 11631  df-2 11692  df-n0 11890  df-z 11974  df-uz 12236  df-seq 13362  df-ndx 16478  df-slot 16479  df-base 16481  df-sets 16482  df-ress 16483  df-plusg 16570  df-0g 16707  df-mgm 17844  df-sgrp 17893  df-mnd 17904  df-submnd 17949  df-mulg 18217  df-od 18648
This theorem is referenced by:  subgod  18687
  Copyright terms: Public domain W3C validator