Theorem omndmul2 30708

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.

Step	Hyp	Ref	Expression
1		df-3an 1085	. . 3 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)) ∧ 0 ≤ 𝑋))
2		anass 471	. . . 4 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ↔ (𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)))
3	2	anbi1i 625	. . 3 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)) ∧ 0 ≤ 𝑋))
4	1, 3	bitr4i 280	. 2 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋))
5		simplr 767	. . 3 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 𝑁 ∈ ℕ0)
6		oveq1 7157	. . . . 5 ⊢ (𝑚 = 0 → (𝑚 · 𝑋) = (0 · 𝑋))
7	6	breq2d 5070	. . . 4 ⊢ (𝑚 = 0 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (0 · 𝑋)))
8		oveq1 7157	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑚 · 𝑋) = (𝑛 · 𝑋))
9	8	breq2d 5070	. . . 4 ⊢ (𝑚 = 𝑛 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑛 · 𝑋)))
10		oveq1 7157	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → (𝑚 · 𝑋) = ((𝑛 + 1) · 𝑋))
11	10	breq2d 5070	. . . 4 ⊢ (𝑚 = (𝑛 + 1) → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ ((𝑛 + 1) · 𝑋)))
12		oveq1 7157	. . . . 5 ⊢ (𝑚 = 𝑁 → (𝑚 · 𝑋) = (𝑁 · 𝑋))
13	12	breq2d 5070	. . . 4 ⊢ (𝑚 = 𝑁 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑁 · 𝑋)))
14		omndtos 30701	. . . . . . . 8 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
15		tospos 30640	. . . . . . . 8 ⊢ (𝑀 ∈ Toset → 𝑀 ∈ Poset)
16	14, 15	syl 17	. . . . . . 7 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Poset)
17		omndmnd 30700	. . . . . . . 8 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)
18		omndmul.0	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑀)
19		omndmul2.3	. . . . . . . . 9 ⊢ 0 = (0g‘𝑀)
20	18, 19	mndidcl 17920	. . . . . . . 8 ⊢ (𝑀 ∈ Mnd → 0 ∈ 𝐵)
21	17, 20	syl 17	. . . . . . 7 ⊢ (𝑀 ∈ oMnd → 0 ∈ 𝐵)
22		omndmul.1	. . . . . . . 8 ⊢ ≤ = (le‘𝑀)
23	18, 22	posref 17555	. . . . . . 7 ⊢ ((𝑀 ∈ Poset ∧ 0 ∈ 𝐵) → 0 ≤ 0 )
24	16, 21, 23	syl2anc 586	. . . . . 6 ⊢ (𝑀 ∈ oMnd → 0 ≤ 0 )
25	24	ad3antrrr 728	. . . . 5 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ 0 )
26		omndmul2.2	. . . . . . 7 ⊢ · = (.g‘𝑀)
27	18, 19, 26	mulg0 18225	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 )
28	27	ad3antlr 729	. . . . 5 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → (0 · 𝑋) = 0 )
29	25, 28	breqtrrd 5086	. . . 4 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (0 · 𝑋))
30	16	ad5antr 732	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Poset)
31	17	ad5antr 732	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Mnd)
32	31, 20	syl 17	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ∈ 𝐵)
33		simplr 767	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑛 ∈ ℕ0)
34		simp-5r 784	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑋 ∈ 𝐵)
35	18, 26	mulgnn0cl 18238	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ 𝑛 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → (𝑛 · 𝑋) ∈ 𝐵)
36	31, 33, 34, 35	syl3anc 1367	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ∈ 𝐵)
37		simpr32 1260	. . . . . . . . . 10 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → 𝑛 ∈ ℕ0)
38		1nn0 11907	. . . . . . . . . . 11 ⊢ 1 ∈ ℕ0
39	38	a1i 11	. . . . . . . . . 10 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → 1 ∈ ℕ0)
40	37, 39	nn0addcld 11953	. . . . . . . . 9 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → (𝑛 + 1) ∈ ℕ0)
41	40	3anassrs 1356	. . . . . . . 8 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋))) → (𝑛 + 1) ∈ ℕ0)
42	41	3anassrs 1356	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 + 1) ∈ ℕ0)
43	18, 26	mulgnn0cl 18238	. . . . . . 7 ⊢ ((𝑀 ∈ Mnd ∧ (𝑛 + 1) ∈ ℕ0 ∧ 𝑋 ∈ 𝐵) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
44	31, 42, 34, 43	syl3anc 1367	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
45	32, 36, 44	3jca 1124	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵))
46		simpr 487	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ (𝑛 · 𝑋))
47		simp-4l 781	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ oMnd)
48	17	ad4antr 730	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ Mnd)
49	48, 20	syl 17	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 ∈ 𝐵)
50		simp-4r 782	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑋 ∈ 𝐵)
51		simpr 487	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
52	48, 51, 50, 35	syl3anc 1367	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ∈ 𝐵)
53		simplr 767	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 ≤ 𝑋)
54		eqid 2821	. . . . . . . . 9 ⊢ (+g‘𝑀) = (+g‘𝑀)
55	18, 22, 54	omndadd 30702	. . . . . . . 8 ⊢ ((𝑀 ∈ oMnd ∧ ( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
56	47, 49, 50, 52, 53, 55	syl131anc 1379	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
57	18, 54, 19	mndlid 17925	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ (𝑛 · 𝑋) ∈ 𝐵) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
58	48, 52, 57	syl2anc 586	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
59	38	a1i 11	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 1 ∈ ℕ0)
60	18, 26, 54	mulgnn0dir 18251	. . . . . . . . 9 ⊢ ((𝑀 ∈ Mnd ∧ (1 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵)) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)))
61	48, 59, 51, 50, 60	syl13anc 1368	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)))
62		1cnd 10630	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 1 ∈ ℂ)
63		simpr3 1192	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝑛 ∈ ℕ0)
64	63	nn0cnd 11951	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝑛 ∈ ℂ)
65	62, 64	addcomd 10836	. . . . . . . . . 10 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → (1 + 𝑛) = (𝑛 + 1))
66	65	3anassrs 1356	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 + 𝑛) = (𝑛 + 1))
67	66	oveq1d 7165	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((𝑛 + 1) · 𝑋))
68	18, 26	mulg1 18229	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋)
69	50, 68	syl 17	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 · 𝑋) = 𝑋)
70	69	oveq1d 7165	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)) = (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
71	61, 67, 70	3eqtr3rd 2865	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑋(+g‘𝑀)(𝑛 · 𝑋)) = ((𝑛 + 1) · 𝑋))
72	56, 58, 71	3brtr3d 5089	. . . . . 6 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
73	72	adantr 483	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
74	18, 22	postr 17557	. . . . . 6 ⊢ ((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) → (( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋)))
75	74	imp 409	. . . . 5 ⊢ (((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) ∧ ( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))) → 0 ≤ ((𝑛 + 1) · 𝑋))
76	30, 45, 46, 73, 75	syl22anc 836	. . . 4 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋))
77	7, 9, 11, 13, 29, 76	nn0indd 12073	. . 3 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑁 ∈ ℕ0) → 0 ≤ (𝑁 · 𝑋))
78	5, 77	mpdan 685	. 2 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))
79	4, 78	sylbi 219	1 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   class class class wbr 5058  ‘cfv 6349  (class class class)co 7150  0cc0 10531  1c1 10532   + caddc 10534  ℕ₀cn0 11891  Basecbs 16477  +_gcplusg 16559  lecple 16566  0_gc0g 16707  Posetcpo 17544  Tosetctos 17637  Mndcmnd 17905  ._gcmg 18218  oMndcomnd 30693

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-tp 4565  df-op 4567  df-uni 4832  df-iun 4913  df-br 5059  df-opab 5121  df-mpt 5139  df-tr 5165  df-id 5454  df-eprel 5459  df-po 5468  df-so 5469  df-fr 5508  df-we 5510  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-res 5561  df-ima 5562  df-pred 6142  df-ord 6188  df-on 6189  df-lim 6190  df-suc 6191  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-f1 6354  df-fo 6355  df-f1o 6356  df-fv 6357  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-er 8283  df-en 8504  df-dom 8505  df-sdom 8506  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-n0 11892  df-z 11976  df-uz 12238  df-fz 12887  df-seq 13364  df-0g 16709  df-proset 17532  df-poset 17550  df-toset 17638  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-mulg 18219  df-omnd 30695

This theorem is referenced by:  omndmul3  30709