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

Theorem omndmul2 20377
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 1105 . . 3 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)) ∧ 0 ≤ 𝑋))
2 anass 474 . . . 4 (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ↔ (𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)))
32anbi1i 636 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0)) ∧ 0 ≤ 𝑋))
41, 3bitr4i 281 . 2 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ↔ (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋))
5 simplr 781 . . 3 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 𝑁 ∈ ℕ0)
6 oveq1 7450 . . . . 5 (𝑚 = 0 → (𝑚 · 𝑋) = (0 · 𝑋))
76breq2d 5118 . . . 4 (𝑚 = 0 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (0 · 𝑋)))
8 oveq1 7450 . . . . 5 (𝑚 = 𝑛 → (𝑚 · 𝑋) = (𝑛 · 𝑋))
98breq2d 5118 . . . 4 (𝑚 = 𝑛 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑛 · 𝑋)))
10 oveq1 7450 . . . . 5 (𝑚 = (𝑛 + 1) → (𝑚 · 𝑋) = ((𝑛 + 1) · 𝑋))
1110breq2d 5118 . . . 4 (𝑚 = (𝑛 + 1) → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ ((𝑛 + 1) · 𝑋)))
12 oveq1 7450 . . . . 5 (𝑚 = 𝑁 → (𝑚 · 𝑋) = (𝑁 · 𝑋))
1312breq2d 5118 . . . 4 (𝑚 = 𝑁 → ( 0 ≤ (𝑚 · 𝑋) ↔ 0 ≤ (𝑁 · 𝑋)))
14 omndtos 20371 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Toset)
15 tospos 18621 . . . . . . . 8 (𝑀 ∈ Toset → 𝑀 ∈ Poset)
1614, 15syl 18 . . . . . . 7 (𝑀 ∈ oMnd → 𝑀 ∈ Poset)
17 omndmnd 20370 . . . . . . . 8 (𝑀 ∈ oMnd → 𝑀 ∈ Mnd)
18 omndmul.0 . . . . . . . . 9 𝐵 = (Base‘𝑀)
19 omndmul2.3 . . . . . . . . 9 0 = (0g‘𝑀)
2018, 19mndidcl 18968 . . . . . . . 8 (𝑀 ∈ Mnd → 0 ∈ 𝐵)
2117, 20syl 18 . . . . . . 7 (𝑀 ∈ oMnd → 0 ∈ 𝐵)
22 omndmul.1 . . . . . . . 8 ≤ = (le‘𝑀)
2318, 22posref 18521 . . . . . . 7 ((𝑀 ∈ Poset ∧ 0 ∈ 𝐵) → 0 ≤ 0 )
2416, 21, 23syl2anc 596 . . . . . 6 (𝑀 ∈ oMnd → 0 ≤ 0 )
2524ad3antrrr 743 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ 0 )
26 omndmul2.2 . . . . . . 7 · = (.g‘𝑀)
2718, 19, 26mulg0 19313 . . . . . 6 (𝑋 ∈ 𝐵 → (0 · 𝑋) = 0 )
2827ad3antlr 744 . . . . 5 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → (0 · 𝑋) = 0 )
2925, 28breqtrrd 5136 . . . 4 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (0 · 𝑋))
3016ad5antr 747 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Poset)
3117ad5antr 747 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑀 ∈ Mnd)
3231, 20syl 18 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ∈ 𝐵)
33 simplr 781 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑛 ∈ ℕ0)
34 simp-5r 798 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 𝑋 ∈ 𝐵)
3518, 26, 31, 33, 34mulgnn0cld 19334 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ∈ 𝐵)
36 simpr32 1283 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → 𝑛 ∈ ℕ0)
37 1nn0 12649 . . . . . . . . . . 11 1 ∈ ℕ0
3837a1i 11 . . . . . . . . . 10 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → 1 ∈ ℕ0)
3936, 38nn0addcld 12698 . . . . . . . . 9 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0 ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋)))) → (𝑛 + 1) ∈ ℕ0)
40393anassrs 1382 . . . . . . . 8 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ ( 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0 ∧ 0 ≤ (𝑛 · 𝑋))) → (𝑛 + 1) ∈ ℕ0)
41403anassrs 1382 . . . . . . 7 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 + 1) ∈ ℕ0)
4218, 26, 31, 41, 34mulgnn0cld 19334 . . . . . 6 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → ((𝑛 + 1) · 𝑋) ∈ 𝐵)
4332, 35, 423jca 1146 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵))
44 simpr 490 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ (𝑛 · 𝑋))
45 simp-4l 795 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ oMnd)
4617ad4antr 745 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑀 ∈ Mnd)
4746, 20syl 18 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 ∈ 𝐵)
48 simp-4r 796 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑋 ∈ 𝐵)
49 simpr 490 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
5018, 26, 46, 49, 48mulgnn0cld 19334 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ∈ 𝐵)
51 simplr 781 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 0 ≤ 𝑋)
52 eqid 2763 . . . . . . . . 9 (+g‘𝑀) = (+g‘𝑀)
5318, 22, 52omndadd 20372 . . . . . . . 8 ((𝑀 ∈ oMnd ∧ ( 0 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵) ∧ 0 ≤ 𝑋) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
5445, 47, 48, 50, 51, 53syl131anc 1411 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) ≤ (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
5518, 52, 19mndlid 18973 . . . . . . . 8 ((𝑀 ∈ Mnd ∧ (𝑛 · 𝑋) ∈ 𝐵) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5646, 50, 55syl2anc 596 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ( 0 (+g‘𝑀)(𝑛 · 𝑋)) = (𝑛 · 𝑋))
5737a1i 11 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → 1 ∈ ℕ0)
5818, 26, 52mulgnn0dir 19343 . . . . . . . . 9 ((𝑀 ∈ Mnd ∧ (1 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0 ∧ 𝑋 ∈ 𝐵)) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)))
5946, 57, 49, 48, 58syl13anc 1400 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)))
60 1cnd 11329 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 1 ∈ ℂ)
61 simpr3 1215 . . . . . . . . . . . 12 (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝑛 ∈ ℕ0)
6261nn0cnd 12696 . . . . . . . . . . 11 (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → 𝑛 ∈ ℂ)
6360, 62addcomd 11539 . . . . . . . . . 10 (((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ (𝑁 ∈ ℕ0 ∧ 0 ≤ 𝑋 ∧ 𝑛 ∈ ℕ0)) → (1 + 𝑛) = (𝑛 + 1))
64633anassrs 1382 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 + 𝑛) = (𝑛 + 1))
6564oveq1d 7458 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 + 𝑛) · 𝑋) = ((𝑛 + 1) · 𝑋))
6618, 26mulg1 19320 . . . . . . . . . 10 (𝑋 ∈ 𝐵 → (1 · 𝑋) = 𝑋)
6748, 66syl 18 . . . . . . . . 9 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (1 · 𝑋) = 𝑋)
6867oveq1d 7458 . . . . . . . 8 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → ((1 · 𝑋)(+g‘𝑀)(𝑛 · 𝑋)) = (𝑋(+g‘𝑀)(𝑛 · 𝑋)))
6959, 65, 683eqtr3rd 2807 . . . . . . 7 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑋(+g‘𝑀)(𝑛 · 𝑋)) = ((𝑛 + 1) · 𝑋))
7054, 56, 693brtr3d 5139 . . . . . 6 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
7170adantr 486 . . . . 5 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))
7218, 22postr 18523 . . . . . 6 ((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) → (( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋)))
7372imp 412 . . . . 5 (((𝑀 ∈ Poset ∧ ( 0 ∈ 𝐵 ∧ (𝑛 · 𝑋) ∈ 𝐵 ∧ ((𝑛 + 1) · 𝑋) ∈ 𝐵)) ∧ ( 0 ≤ (𝑛 · 𝑋) ∧ (𝑛 · 𝑋) ≤ ((𝑛 + 1) · 𝑋))) → 0 ≤ ((𝑛 + 1) · 𝑋))
7430, 43, 44, 71, 73syl22anc 852 . . . 4 ((((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑛 ∈ ℕ0) ∧ 0 ≤ (𝑛 · 𝑋)) → 0 ≤ ((𝑛 + 1) · 𝑋))
757, 9, 11, 13, 29, 74nn0indd 12823 . . 3 (((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) ∧ 𝑁 ∈ ℕ0) → 0 ≤ (𝑁 · 𝑋))
765, 75mpdan 700 . 2 ((((𝑀 ∈ oMnd ∧ 𝑋 ∈ 𝐵) ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))
774, 76sylbi 220 1 ((𝑀 ∈ oMnd ∧ (𝑋 ∈ 𝐵 ∧ 𝑁 ∈ ℕ0) ∧ 0 ≤ 𝑋) → 0 ≤ (𝑁 · 𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   class class class wbr 5106  ‘cfv 6558  (class class class)co 7443  0cc0 11227  1c1 11228   + caddc 11230  ℕ0cn0 12633  Basecbs 17416  +gcplusg 17457  lecple 17464  0gc0g 17639  Posetcpo 18510  Tosetctos 18617  Mndcmnd 18952  .gcmg 19306  oMndcomnd 20363
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-cnex 11283  ax-resscn 11284  ax-1cn 11285  ax-icn 11286  ax-addcl 11287  ax-addrcl 11288  ax-mulcl 11289  ax-mulrcl 11290  ax-mulcom 11291  ax-addass 11292  ax-mulass 11293  ax-distr 11294  ax-i2m1 11295  ax-1ne0 11296  ax-1rid 11297  ax-rnegex 11298  ax-rrecex 11299  ax-cnre 11300  ax-pre-lttri 11301  ax-pre-lttrn 11302  ax-pre-ltadd 11303  ax-pre-mulgt0 11304
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-er 8745  df-en 9002  df-dom 9003  df-sdom 9004  df-pnf 11372  df-mnf 11373  df-xr 11374  df-ltxr 11375  df-le 11376  df-sub 11570  df-neg 11571  df-nn 12363  df-n0 12634  df-z 12721  df-uz 12993  df-fz 13667  df-seq 14172  df-0g 17641  df-proset 18497  df-poset 18516  df-toset 18618  df-mgm 18845  df-sgrp 18937  df-mnd 18953  df-mulg 19307  df-omnd 20365
This theorem is used by:  omndmul3  20378
  Copyright terms: Public domain W3C validator