Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  omndmul2 Structured version   Visualization version   GIF version

Theorem omndmul2 33028
Description: In an ordered monoid, the ordering is compatible with group power. This version does not require the monoid to be commutative. (Contributed by Thierry Arnoux, 23-Mar-2018.)
Hypotheses
Ref Expression
omndmul.0 𝐵 = (Base‘𝑀)
omndmul.1 = (le‘𝑀)
omndmul2.2 · = (.g𝑀)
omndmul2.3 0 = (0g𝑀)
Assertion
Ref Expression
omndmul2 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 (𝑁 · 𝑋))

Proof of Theorem omndmul2
Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-3an 1088 . . 3 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)) ∧ 0 𝑋))
2 anass 468 . . . 4 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ↔ (𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)))
32anbi1i 624 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)) ∧ 0 𝑋))
41, 3bitr4i 278 . 2 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋))
5 simplr 768 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 𝑁 ∈ ℕ0)
6 oveq1 7420 . . . . 5 (𝑚 = 0 → (𝑚 · 𝑋) = (0 · 𝑋))
76breq2d 5135 . . . 4 (𝑚 = 0 → ( 0 (𝑚 · 𝑋) ↔ 0 (0 · 𝑋)))
8 oveq1 7420 . . . . 5 (𝑚 = 𝑛 → (𝑚 · 𝑋) = (𝑛 · 𝑋))
98breq2d 5135 . . . 4 (𝑚 = 𝑛 → ( 0 (𝑚 · 𝑋) ↔ 0 (𝑛 · 𝑋)))
10 oveq1 7420 . . . . 5 (𝑚 = (𝑛 + 1) → (𝑚 · 𝑋) = ((𝑛 + 1) · 𝑋))
1110breq2d 5135 . . . 4 (𝑚 = (𝑛 + 1) → ( 0 (𝑚 · 𝑋) ↔ 0 ((𝑛 + 1) · 𝑋)))
12 oveq1 7420 . . . . 5 (𝑚 = 𝑁 → (𝑚 · 𝑋) = (𝑁 · 𝑋))
1312breq2d 5135 . . . 4 (𝑚 = 𝑁 → ( 0 (𝑚 · 𝑋) ↔ 0 (𝑁 · 𝑋)))
14 omndtos 33021 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
15 tospos 18434 . . . . . . . 8 (𝑀 ∈ Toset → 𝑀 ∈ Poset)
1614, 15syl 17 . . . . . . 7 (𝑀 ∈ oMnd → 𝑀 ∈ Poset)
17 omndmnd 33020 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)
18 omndmul.0 . . . . . . . . 9 𝐵 = (Base‘𝑀)
19 omndmul2.3 . . . . . . . . 9 0 = (0g𝑀)
2018, 19mndidcl 18731 . . . . . . . 8 (𝑀 ∈ Mnd → 0𝐵)
2117, 20syl 17 . . . . . . 7 (𝑀 ∈ oMnd → 0𝐵)
22 omndmul.1 . . . . . . . 8 = (le‘𝑀)
2318, 22posref 18334 . . . . . . 7 ((𝑀 ∈ Poset ∧ 0𝐵) → 0 0 )
2416, 21, 23syl2anc 584 . . . . . 6 (𝑀 ∈ oMnd → 0 0 )
2524ad3antrrr 730 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 0 )
26 omndmul2.2 . . . . . . 7 · = (.g𝑀)
2718, 19, 26mulg0 19061 . . . . . 6 (𝑋𝐵 → (0 · 𝑋) = 0 )
2827ad3antlr 731 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → (0 · 𝑋) = 0 )
2925, 28breqtrrd 5151 . . . 4 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 (0 · 𝑋))
3016ad5antr 734 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑀 ∈ Poset)
3117ad5antr 734 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑀 ∈ Mnd)
3231, 20syl 17 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0𝐵)
33 simplr 768 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑛 ∈ ℕ0)
34 simp-5r 785 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑋𝐵)
3518, 26, 31, 33, 34mulgnn0cld 19082 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 · 𝑋) ∈ 𝐵)
36 simpr32 1264 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → 𝑛 ∈ ℕ0)
37 1nn0 12525 . . . . . . . . . . 11 1 ∈ ℕ0
3837a1i 11 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → 1 ∈ ℕ0)
3936, 38nn0addcld 12574 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → (𝑛 + 1) ∈ ℕ0)
40393anassrs 1360 . . . . . . . 8 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋))) → (𝑛 + 1) ∈ ℕ0)
41403anassrs 1360 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 + 1) ∈ ℕ0)
4218, 26, 31, 41, 34mulgnn0cld 19082 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
4332, 35, 423jca 1128 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵))
44 simpr 484 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0 (𝑛 · 𝑋))
45 simp-4l 782 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ oMnd)
4617ad4antr 732 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ Mnd)
4746, 20syl 17 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 0𝐵)
48 simp-4r 783 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑋𝐵)
49 simpr 484 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
5018, 26, 46, 49, 48mulgnn0cld 19082 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ∈ 𝐵)
51 simplr 768 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 𝑋)
52 eqid 2734 . . . . . . . . 9 (+g𝑀) = (+g𝑀)
5318, 22, 52omndadd 33022 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ ( 0𝐵𝑋𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵) ∧ 0 𝑋) → ( 0 (+g𝑀)(𝑛 · 𝑋)) (𝑋(+g𝑀)(𝑛 · 𝑋)))
5445, 47, 48, 50, 51, 53syl131anc 1384 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g𝑀)(𝑛 · 𝑋)) (𝑋(+g𝑀)(𝑛 · 𝑋)))
5518, 52, 19mndlid 18736 . . . . . . . 8 ((𝑀 ∈ Mnd ∧ (𝑛 · 𝑋) ∈ 𝐵) → ( 0 (+g𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5646, 50, 55syl2anc 584 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5737a1i 11 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 1 ∈ ℕ0)
5818, 26, 52mulgnn0dir 19091 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ (1 ∈ ℕ0𝑛 ∈ ℕ0𝑋𝐵)) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)))
5946, 57, 49, 48, 58syl13anc 1373 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)))
60 1cnd 11238 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 1 ∈ ℂ)
61 simpr3 1196 . . . . . . . . . . . 12 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 𝑛 ∈ ℕ0)
6261nn0cnd 12572 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 𝑛 ∈ ℂ)
6360, 62addcomd 11445 . . . . . . . . . 10 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → (1 + 𝑛) = (𝑛 + 1))
64633anassrs 1360 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 + 𝑛) = (𝑛 + 1))
6564oveq1d 7428 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((𝑛 + 1) · 𝑋))
6618, 26mulg1 19068 . . . . . . . . . 10 (𝑋𝐵 → (1 · 𝑋) = 𝑋)
6748, 66syl 17 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 · 𝑋) = 𝑋)
6867oveq1d 7428 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)) = (𝑋(+g𝑀)(𝑛 · 𝑋)))
6959, 65, 683eqtr3rd 2778 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑋(+g𝑀)(𝑛 · 𝑋)) = ((𝑛 + 1) · 𝑋))
7054, 56, 693brtr3d 5154 . . . . . 6 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))
7170adantr 480 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))
7218, 22postr 18336 . . . . . 6 ((𝑀 ∈ Poset ∧ ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) → (( 0 (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋)) → 0 ((𝑛 + 1) · 𝑋)))
7372imp 406 . . . . 5 (((𝑀 ∈ Poset ∧ ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) ∧ ( 0 (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))) → 0 ((𝑛 + 1) · 𝑋))
7430, 43, 44, 71, 73syl22anc 838 . . . 4 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0 ((𝑛 + 1) · 𝑋))
757, 9, 11, 13, 29, 74nn0indd 12698 . . 3 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑁 ∈ ℕ0) → 0 (𝑁 · 𝑋))
765, 75mpdan 687 . 2 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 (𝑁 · 𝑋))
774, 76sylbi 217 1 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 (𝑁 · 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1539  wcel 2107   class class class wbr 5123  cfv 6541  (class class class)co 7413  0cc0 11137  1c1 11138   + caddc 11140  0cn0 12509  Basecbs 17229  +gcplusg 17273  lecple 17280  0gc0g 17455  Posetcpo 18323  Tosetctos 18430  Mndcmnd 18716  .gcmg 19054  oMndcomnd 33013
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-sep 5276  ax-nul 5286  ax-pow 5345  ax-pr 5412  ax-un 7737  ax-cnex 11193  ax-resscn 11194  ax-1cn 11195  ax-icn 11196  ax-addcl 11197  ax-addrcl 11198  ax-mulcl 11199  ax-mulrcl 11200  ax-mulcom 11201  ax-addass 11202  ax-mulass 11203  ax-distr 11204  ax-i2m1 11205  ax-1ne0 11206  ax-1rid 11207  ax-rnegex 11208  ax-rrecex 11209  ax-cnre 11210  ax-pre-lttri 11211  ax-pre-lttrn 11212  ax-pre-ltadd 11213  ax-pre-mulgt0 11214
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-nel 3036  df-ral 3051  df-rex 3060  df-rmo 3363  df-reu 3364  df-rab 3420  df-v 3465  df-sbc 3771  df-csb 3880  df-dif 3934  df-un 3936  df-in 3938  df-ss 3948  df-pss 3951  df-nul 4314  df-if 4506  df-pw 4582  df-sn 4607  df-pr 4609  df-op 4613  df-uni 4888  df-iun 4973  df-br 5124  df-opab 5186  df-mpt 5206  df-tr 5240  df-id 5558  df-eprel 5564  df-po 5572  df-so 5573  df-fr 5617  df-we 5619  df-xp 5671  df-rel 5672  df-cnv 5673  df-co 5674  df-dm 5675  df-rn 5676  df-res 5677  df-ima 5678  df-pred 6301  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7870  df-1st 7996  df-2nd 7997  df-frecs 8288  df-wrecs 8319  df-recs 8393  df-rdg 8432  df-er 8727  df-en 8968  df-dom 8969  df-sdom 8970  df-pnf 11279  df-mnf 11280  df-xr 11281  df-ltxr 11282  df-le 11283  df-sub 11476  df-neg 11477  df-nn 12249  df-n0 12510  df-z 12597  df-uz 12861  df-fz 13530  df-seq 14025  df-0g 17457  df-proset 18310  df-poset 18329  df-toset 18431  df-mgm 18622  df-sgrp 18701  df-mnd 18717  df-mulg 19055  df-omnd 33015
This theorem is referenced by:  omndmul3  33029
  Copyright terms: Public domain W3C validator