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

Theorem omndmul2 20108
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 1089 . . 3 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)) ∧ 0 𝑋))
2 anass 468 . . . 4 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ↔ (𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)))
32anbi1i 625 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0)) ∧ 0 𝑋))
41, 3bitr4i 278 . 2 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0) ∧ 0 𝑋) ↔ (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋))
5 simplr 769 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 𝑁 ∈ ℕ0)
6 oveq1 7374 . . . . 5 (𝑚 = 0 → (𝑚 · 𝑋) = (0 · 𝑋))
76breq2d 5097 . . . 4 (𝑚 = 0 → ( 0 (𝑚 · 𝑋) ↔ 0 (0 · 𝑋)))
8 oveq1 7374 . . . . 5 (𝑚 = 𝑛 → (𝑚 · 𝑋) = (𝑛 · 𝑋))
98breq2d 5097 . . . 4 (𝑚 = 𝑛 → ( 0 (𝑚 · 𝑋) ↔ 0 (𝑛 · 𝑋)))
10 oveq1 7374 . . . . 5 (𝑚 = (𝑛 + 1) → (𝑚 · 𝑋) = ((𝑛 + 1) · 𝑋))
1110breq2d 5097 . . . 4 (𝑚 = (𝑛 + 1) → ( 0 (𝑚 · 𝑋) ↔ 0 ((𝑛 + 1) · 𝑋)))
12 oveq1 7374 . . . . 5 (𝑚 = 𝑁 → (𝑚 · 𝑋) = (𝑁 · 𝑋))
1312breq2d 5097 . . . 4 (𝑚 = 𝑁 → ( 0 (𝑚 · 𝑋) ↔ 0 (𝑁 · 𝑋)))
14 omndtos 20102 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
15 tospos 18384 . . . . . . . 8 (𝑀 ∈ Toset → 𝑀 ∈ Poset)
1614, 15syl 17 . . . . . . 7 (𝑀 ∈ oMnd → 𝑀 ∈ Poset)
17 omndmnd 20101 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)
18 omndmul.0 . . . . . . . . 9 𝐵 = (Base‘𝑀)
19 omndmul2.3 . . . . . . . . 9 0 = (0g𝑀)
2018, 19mndidcl 18717 . . . . . . . 8 (𝑀 ∈ Mnd → 0𝐵)
2117, 20syl 17 . . . . . . 7 (𝑀 ∈ oMnd → 0𝐵)
22 omndmul.1 . . . . . . . 8 = (le‘𝑀)
2318, 22posref 18284 . . . . . . 7 ((𝑀 ∈ Poset ∧ 0𝐵) → 0 0 )
2416, 21, 23syl2anc 585 . . . . . 6 (𝑀 ∈ oMnd → 0 0 )
2524ad3antrrr 731 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 0 )
26 omndmul2.2 . . . . . . 7 · = (.g𝑀)
2718, 19, 26mulg0 19050 . . . . . 6 (𝑋𝐵 → (0 · 𝑋) = 0 )
2827ad3antlr 732 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → (0 · 𝑋) = 0 )
2925, 28breqtrrd 5113 . . . 4 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) → 0 (0 · 𝑋))
3016ad5antr 735 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑀 ∈ Poset)
3117ad5antr 735 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑀 ∈ Mnd)
3231, 20syl 17 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0𝐵)
33 simplr 769 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑛 ∈ ℕ0)
34 simp-5r 786 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 𝑋𝐵)
3518, 26, 31, 33, 34mulgnn0cld 19071 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 · 𝑋) ∈ 𝐵)
36 simpr32 1266 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → 𝑛 ∈ ℕ0)
37 1nn0 12453 . . . . . . . . . . 11 1 ∈ ℕ0
3837a1i 11 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → 1 ∈ ℕ0)
3936, 38nn0addcld 12502 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑋𝐵𝑁 ∈ ℕ0 ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋)))) → (𝑛 + 1) ∈ ℕ0)
40393anassrs 1362 . . . . . . . 8 ((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ ( 0 𝑋𝑛 ∈ ℕ00 (𝑛 · 𝑋))) → (𝑛 + 1) ∈ ℕ0)
41403anassrs 1362 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 + 1) ∈ ℕ0)
4218, 26, 31, 41, 34mulgnn0cld 19071 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
4332, 35, 423jca 1129 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵))
44 simpr 484 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0 (𝑛 · 𝑋))
45 simp-4l 783 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ oMnd)
4617ad4antr 733 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ Mnd)
4746, 20syl 17 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 0𝐵)
48 simp-4r 784 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑋𝐵)
49 simpr 484 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
5018, 26, 46, 49, 48mulgnn0cld 19071 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ∈ 𝐵)
51 simplr 769 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 𝑋)
52 eqid 2736 . . . . . . . . 9 (+g𝑀) = (+g𝑀)
5318, 22, 52omndadd 20103 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ ( 0𝐵𝑋𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵) ∧ 0 𝑋) → ( 0 (+g𝑀)(𝑛 · 𝑋)) (𝑋(+g𝑀)(𝑛 · 𝑋)))
5445, 47, 48, 50, 51, 53syl131anc 1386 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g𝑀)(𝑛 · 𝑋)) (𝑋(+g𝑀)(𝑛 · 𝑋)))
5518, 52, 19mndlid 18722 . . . . . . . 8 ((𝑀 ∈ Mnd ∧ (𝑛 · 𝑋) ∈ 𝐵) → ( 0 (+g𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5646, 50, 55syl2anc 585 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5737a1i 11 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → 1 ∈ ℕ0)
5818, 26, 52mulgnn0dir 19080 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ (1 ∈ ℕ0𝑛 ∈ ℕ0𝑋𝐵)) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)))
5946, 57, 49, 48, 58syl13anc 1375 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)))
60 1cnd 11139 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 1 ∈ ℂ)
61 simpr3 1198 . . . . . . . . . . . 12 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 𝑛 ∈ ℕ0)
6261nn0cnd 12500 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → 𝑛 ∈ ℂ)
6360, 62addcomd 11348 . . . . . . . . . 10 (((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ (𝑁 ∈ ℕ00 𝑋𝑛 ∈ ℕ0)) → (1 + 𝑛) = (𝑛 + 1))
64633anassrs 1362 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 + 𝑛) = (𝑛 + 1))
6564oveq1d 7382 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((𝑛 + 1) · 𝑋))
6618, 26mulg1 19057 . . . . . . . . . 10 (𝑋𝐵 → (1 · 𝑋) = 𝑋)
6748, 66syl 17 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 · 𝑋) = 𝑋)
6867oveq1d 7382 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 · 𝑋)(+g𝑀)(𝑛 · 𝑋)) = (𝑋(+g𝑀)(𝑛 · 𝑋)))
6959, 65, 683eqtr3rd 2780 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑋(+g𝑀)(𝑛 · 𝑋)) = ((𝑛 + 1) · 𝑋))
7054, 56, 693brtr3d 5116 . . . . . 6 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))
7170adantr 480 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))
7218, 22postr 18286 . . . . . 6 ((𝑀 ∈ Poset ∧ ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) → (( 0 (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋)) → 0 ((𝑛 + 1) · 𝑋)))
7372imp 406 . . . . 5 (((𝑀 ∈ Poset ∧ ( 0𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) ∧ ( 0 (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ((𝑛 + 1) · 𝑋))) → 0 ((𝑛 + 1) · 𝑋))
7430, 43, 44, 71, 73syl22anc 839 . . . 4 ((((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 (𝑛 · 𝑋)) → 0 ((𝑛 + 1) · 𝑋))
757, 9, 11, 13, 29, 74nn0indd 12626 . . 3 (((((𝑀 ∈ oMnd ∧ 𝑋𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 𝑋) ∧ 𝑁 ∈ ℕ0) → 0 (𝑁 · 𝑋))
765, 75mpdan 688 . 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 1087   = wceq 1542  wcel 2114   class class class wbr 5085  cfv 6498  (class class class)co 7367  0cc0 11038  1c1 11039   + caddc 11041  0cn0 12437  Basecbs 17179  +gcplusg 17220  lecple 17227  0gc0g 17402  Posetcpo 18273  Tosetctos 18380  Mndcmnd 18702  .gcmg 19043  oMndcomnd 20094
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-nn 12175  df-n0 12438  df-z 12525  df-uz 12789  df-fz 13462  df-seq 13964  df-0g 17404  df-proset 18260  df-poset 18279  df-toset 18381  df-mgm 18608  df-sgrp 18687  df-mnd 18703  df-mulg 19044  df-omnd 20096
This theorem is referenced by:  omndmul3  20109
  Copyright terms: Public domain W3C validator