omndmul2 - Mathbox for Thierry Arnoux

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

Theorem omndmul2 32736

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 = (0_g‘𝑀)

**Assertion**
Ref	Expression
omndmul2	⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))

Proof of Theorem omndmul2 Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-3an 1086	. . 3 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀)) ∧ 0 ≤ 𝑋))
2		anass 468	. . . 4 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ↔ (𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀)))
3	2	anbi1i 623	. . 3 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀)) ∧ 0 ≤ 𝑋))
4	1, 3	bitr4i 278	. 2 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ↔ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋))
5		simplr 766	. . 3 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 𝑁 ∈ ℕ₀)
6		oveq1 7412	. . . . 5 ⊢ (𝑚 = 0 → (𝑚 · 𝑋) = (0 · 𝑋))
7	6	breq2d 5153	. . . 4 ⊢ (𝑚 = 0 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (0 · 𝑋)))
8		oveq1 7412	. . . . 5 ⊢ (𝑚 = 𝑛 → (𝑚 · 𝑋) = (𝑛 · 𝑋))
9	8	breq2d 5153	. . . 4 ⊢ (𝑚 = 𝑛 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑛 · 𝑋)))
10		oveq1 7412	. . . . 5 ⊢ (𝑚 = (𝑛 + 1) → (𝑚 · 𝑋) = ((𝑛 + 1) · 𝑋))
11	10	breq2d 5153	. . . 4 ⊢ (𝑚 = (𝑛 + 1) → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ ((𝑛 + 1) · 𝑋)))
12		oveq1 7412	. . . . 5 ⊢ (𝑚 = 𝑁 → (𝑚 · 𝑋) = (𝑁 · 𝑋))
13	12	breq2d 5153	. . . 4 ⊢ (𝑚 = 𝑁 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑁 · 𝑋)))
14		omndtos 32729	. . . . . . . 8 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
15		tospos 18385	. . . . . . . 8 ⊢ (𝑀 ∈ Toset → 𝑀 ∈ Poset)
16	14, 15	syl 17	. . . . . . 7 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Poset)
17		omndmnd 32728	. . . . . . . 8 ⊢ (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)
18		omndmul.0	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑀)
19		omndmul2.3	. . . . . . . . 9 ⊢ 0 = (0_g‘𝑀)
20	18, 19	mndidcl 18682	. . . . . . . 8 ⊢ (𝑀 ∈ Mnd → 0 ∈ 𝐵)
21	17, 20	syl 17	. . . . . . 7 ⊢ (𝑀 ∈ oMnd → 0 ∈ 𝐵)
22		omndmul.1	. . . . . . . 8 ⊢ ≤ = (le‘𝑀)
23	18, 22	posref 18283	. . . . . . 7 ⊢ ((𝑀 ∈ Poset ∧ 0 ∈ 𝐵) → 0 ≤ 0 )
24	16, 21, 23	syl2anc 583	. . . . . 6 ⊢ (𝑀 ∈ oMnd → 0 ≤ 0 )
25	24	ad3antrrr 727	. . . . 5 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 0 ≤ 0 )
26		omndmul2.2	. . . . . . 7 ⊢ · = (._g‘𝑀)
27	18, 19, 26	mulg0 19002	. . . . . 6 ⊢ (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 )
28	27	ad3antlr 728	. . . . 5 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → (0 · 𝑋) = 0 )
29	25, 28	breqtrrd 5169	. . . 4 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 0 ≤ (0 · 𝑋))
30	16	ad5antr 731	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Poset)
31	17	ad5antr 731	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Mnd)
32	31, 20	syl 17	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ∈ 𝐵)
33		simplr 766	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑛 ∈ ℕ₀)
34		simp-5r 783	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑋 ∈ 𝐵)
35	18, 26, 31, 33, 34	mulgnn0cld 19022	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ∈ 𝐵)
36		simpr32 1261	. . . . . . . . . 10 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀ ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀ ∧ 0 ≤ (𝑛 · 𝑋)))) → 𝑛 ∈ ℕ₀)
37		1nn0 12492	. . . . . . . . . . 11 ⊢ 1 ∈ ℕ₀
38	37	a1i 11	. . . . . . . . . 10 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀ ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀ ∧ 0 ≤ (𝑛 · 𝑋)))) → 1 ∈ ℕ₀)
39	36, 38	nn0addcld 12540	. . . . . . . . 9 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀ ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀ ∧ 0 ≤ (𝑛 · 𝑋)))) → (𝑛 + 1) ∈ ℕ₀)
40	39	3anassrs 1357	. . . . . . . 8 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀ ∧ 0 ≤ (𝑛 · 𝑋))) → (𝑛 + 1) ∈ ℕ₀)
41	40	3anassrs 1357	. . . . . . 7 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 + 1) ∈ ℕ₀)
42	18, 26, 31, 41, 34	mulgnn0cld 19022	. . . . . 6 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
43	32, 35, 42	3jca 1125	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵))
44		simpr 484	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ (𝑛 · 𝑋))
45		simp-4l 780	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 𝑀 ∈ oMnd)
46	17	ad4antr 729	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 𝑀 ∈ Mnd)
47	46, 20	syl 17	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 0 ∈ 𝐵)
48		simp-4r 781	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 𝑋 ∈ 𝐵)
49		simpr 484	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 𝑛 ∈ ℕ₀)
50	18, 26, 46, 49, 48	mulgnn0cld 19022	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → (𝑛 · 𝑋) ∈ 𝐵)
51		simplr 766	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 0 ≤ 𝑋)
52		eqid 2726	. . . . . . . . 9 ⊢ (+_g‘𝑀) = (+_g‘𝑀)
53	18, 22, 52	omndadd 32730	. . . . . . . 8 ⊢ ((𝑀 ∈ oMnd ∧ ( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+_g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+_g‘𝑀)(𝑛 · 𝑋)))
54	45, 47, 48, 50, 51, 53	syl131anc 1380	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → ( 0 (+_g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+_g‘𝑀)(𝑛 · 𝑋)))
55	18, 52, 19	mndlid 18687	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ (𝑛 · 𝑋) ∈ 𝐵) → ( 0 (+_g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
56	46, 50, 55	syl2anc 583	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → ( 0 (+_g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
57	37	a1i 11	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → 1 ∈ ℕ₀)
58	18, 26, 52	mulgnn0dir 19031	. . . . . . . . 9 ⊢ ((𝑀 ∈ Mnd ∧ (1 ∈ ℕ₀ ∧ 𝑛 ∈ ℕ₀ ∧ 𝑋 ∈ 𝐵)) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+_g‘𝑀)(𝑛 · 𝑋)))
59	46, 57, 49, 48, 58	syl13anc 1369	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+_g‘𝑀)(𝑛 · 𝑋)))
60		1cnd 11213	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ₀ ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀)) → 1 ∈ ℂ)
61		simpr3 1193	. . . . . . . . . . . 12 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ₀ ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀)) → 𝑛 ∈ ℕ₀)
62	61	nn0cnd 12538	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ₀ ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀)) → 𝑛 ∈ ℂ)
63	60, 62	addcomd 11420	. . . . . . . . . 10 ⊢ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ₀ ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ₀)) → (1 + 𝑛) = (𝑛 + 1))
64	63	3anassrs 1357	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → (1 + 𝑛) = (𝑛 + 1))
65	64	oveq1d 7420	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → ((1 + 𝑛) · 𝑋) = ((𝑛 + 1) · 𝑋))
66	18, 26	mulg1 19008	. . . . . . . . . 10 ⊢ (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋)
67	48, 66	syl 17	. . . . . . . . 9 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → (1 · 𝑋) = 𝑋)
68	67	oveq1d 7420	. . . . . . . 8 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → ((1 · 𝑋)(+_g‘𝑀)(𝑛 · 𝑋)) = (𝑋(+_g‘𝑀)(𝑛 · 𝑋)))
69	59, 65, 68	3eqtr3rd 2775	. . . . . . 7 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → (𝑋(+_g‘𝑀)(𝑛 · 𝑋)) = ((𝑛 + 1) · 𝑋))
70	54, 56, 69	3brtr3d 5172	. . . . . 6 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
71	70	adantr 480	. . . . 5 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
72	18, 22	postr 18285	. . . . . 6 ⊢ ((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) → (( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋)))
73	72	imp 406	. . . . 5 ⊢ (((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) ∧ ( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))) → 0 ≤ ((𝑛 + 1) · 𝑋))
74	30, 43, 44, 71, 73	syl22anc 836	. . . 4 ⊢ ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ₀) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋))
75	7, 9, 11, 13, 29, 74	nn0indd 12663	. . 3 ⊢ (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) ∧ 𝑁 ∈ ℕ₀) → 0 ≤ (𝑁 · 𝑋))
76	5, 75	mpdan 684	. 2 ⊢ ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))
77	4, 76	sylbi 216	1 ⊢ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ₀) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1084 = wceq 1533 ∈ wcel 2098 class class class wbr 5141 ‘cfv 6537 (class class class)co 7405 0cc0 11112 1c1 11113 + caddc 11115 ℕ₀cn0 12476 Basecbs 17153 +_gcplusg 17206 lecple 17213 0_gc0g 17394 Posetcpo 18272 Tosetctos 18381 Mndcmnd 18667 ._gcmg 18995 oMndcomnd 32721

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2697 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7722 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2704 df-cleq 2718 df-clel 2804 df-nfc 2879 df-ne 2935 df-nel 3041 df-ral 3056 df-rex 3065 df-rmo 3370 df-reu 3371 df-rab 3427 df-v 3470 df-sbc 3773 df-csb 3889 df-dif 3946 df-un 3948 df-in 3950 df-ss 3960 df-pss 3962 df-nul 4318 df-if 4524 df-pw 4599 df-sn 4624 df-pr 4626 df-op 4630 df-uni 4903 df-iun 4992 df-br 5142 df-opab 5204 df-mpt 5225 df-tr 5259 df-id 5567 df-eprel 5573 df-po 5581 df-so 5582 df-fr 5624 df-we 5626 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-pred 6294 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6489 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7853 df-1st 7974 df-2nd 7975 df-frecs 8267 df-wrecs 8298 df-recs 8372 df-rdg 8411 df-er 8705 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-n0 12477 df-z 12563 df-uz 12827 df-fz 13491 df-seq 13973 df-0g 17396 df-proset 18260 df-poset 18278 df-toset 18382 df-mgm 18573 df-sgrp 18652 df-mnd 18668 df-mulg 18996 df-omnd 32723

This theorem is referenced by: omndmul3 32737

W3C validator