Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  signstres Structured version   Visualization version   GIF version
Theorem signstres 33655
Description: Restriction of a zero skipping sign to a subword. (Contributed by Thierry Arnoux, 11-Oct-2018.)
Hypotheses
Ref Expression
signsv.p ⨣ = (π‘Ž ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, π‘Ž, 𝑏))
signsv.w π‘Š = {⟨(Baseβ€˜ndx), {-1, 0, 1}⟩, ⟨(+gβ€˜ndx), ⨣ ⟩}
signsv.t 𝑇 = (𝑓 ∈ Word ℝ ↦ (𝑛 ∈ (0..^(β™―β€˜π‘“)) ↦ (π‘Š Ξ£g (𝑖 ∈ (0...𝑛) ↦ (sgnβ€˜(π‘“β€˜π‘–))))))
signsv.v 𝑉 = (𝑓 ∈ Word ℝ ↦ Σ𝑗 ∈ (1..^(β™―β€˜π‘“))if(((π‘‡β€˜π‘“)β€˜π‘—) β‰  ((π‘‡β€˜π‘“)β€˜(𝑗 βˆ’ 1)), 1, 0))
Assertion
Ref Expression
signstres ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) = (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))
Distinct variable groups:   π‘Ž,𝑏, ⨣   𝑓,𝑖,𝑛,𝐹   𝑓,π‘Š,𝑖,𝑛   𝑓,𝑁,𝑖,𝑛
Allowed substitution hints:   ⨣ (𝑓,𝑖,𝑗,𝑛)   𝑇(𝑓,𝑖,𝑗,𝑛,π‘Ž,𝑏)   𝐹(𝑗,π‘Ž,𝑏)   𝑁(𝑗,π‘Ž,𝑏)   𝑉(𝑓,𝑖,𝑗,𝑛,π‘Ž,𝑏)   π‘Š(𝑗,π‘Ž,𝑏)
Proof of Theorem signstres
Dummy variables 𝑔 π‘š are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 signsv.p . . . . . . . 8 ⨣ = (π‘Ž ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, π‘Ž, 𝑏))
2 signsv.w . . . . . . . 8 π‘Š = {⟨(Baseβ€˜ndx), {-1, 0, 1}⟩, ⟨(+gβ€˜ndx), ⨣ ⟩}
3 signsv.t . . . . . . . 8 𝑇 = (𝑓 ∈ Word ℝ ↦ (𝑛 ∈ (0..^(β™―β€˜π‘“)) ↦ (π‘Š Ξ£g (𝑖 ∈ (0...𝑛) ↦ (sgnβ€˜(π‘“β€˜π‘–))))))
4 signsv.v . . . . . . . 8 𝑉 = (𝑓 ∈ Word ℝ ↦ Σ𝑗 ∈ (1..^(β™―β€˜π‘“))if(((π‘‡β€˜π‘“)β€˜π‘—) β‰  ((π‘‡β€˜π‘“)β€˜(𝑗 βˆ’ 1)), 1, 0))
51, 2, 3, 4signstf 33646 . . . . . . 7 (𝐹 ∈ Word ℝ β†’ (π‘‡β€˜πΉ) ∈ Word ℝ)
6 wrdf 14471 . . . . . . 7 ((π‘‡β€˜πΉ) ∈ Word ℝ β†’ (π‘‡β€˜πΉ):(0..^(β™―β€˜(π‘‡β€˜πΉ)))βŸΆβ„)
7 ffn 6717 . . . . . . 7 ((π‘‡β€˜πΉ):(0..^(β™―β€˜(π‘‡β€˜πΉ)))βŸΆβ„ β†’ (π‘‡β€˜πΉ) Fn (0..^(β™―β€˜(π‘‡β€˜πΉ))))
85, 6, 73syl 18 . . . . . 6 (𝐹 ∈ Word ℝ β†’ (π‘‡β€˜πΉ) Fn (0..^(β™―β€˜(π‘‡β€˜πΉ))))
91, 2, 3, 4signstlen 33647 . . . . . . . 8 (𝐹 ∈ Word ℝ β†’ (β™―β€˜(π‘‡β€˜πΉ)) = (β™―β€˜πΉ))
109oveq2d 7427 . . . . . . 7 (𝐹 ∈ Word ℝ β†’ (0..^(β™―β€˜(π‘‡β€˜πΉ))) = (0..^(β™―β€˜πΉ)))
1110fneq2d 6643 . . . . . 6 (𝐹 ∈ Word ℝ β†’ ((π‘‡β€˜πΉ) Fn (0..^(β™―β€˜(π‘‡β€˜πΉ))) ↔ (π‘‡β€˜πΉ) Fn (0..^(β™―β€˜πΉ))))
128, 11mpbid 231 . . . . 5 (𝐹 ∈ Word ℝ β†’ (π‘‡β€˜πΉ) Fn (0..^(β™―β€˜πΉ)))
13 fnresin 31888 . . . . 5 ((π‘‡β€˜πΉ) Fn (0..^(β™―β€˜πΉ)) β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)))
1412, 13syl 17 . . . 4 (𝐹 ∈ Word ℝ β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)))
1514adantr 481 . . 3 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)))
16 elfzuz3 13500 . . . . . 6 (𝑁 ∈ (0...(β™―β€˜πΉ)) β†’ (β™―β€˜πΉ) ∈ (β„€β‰₯β€˜π‘))
17 fzoss2 13662 . . . . . 6 ((β™―β€˜πΉ) ∈ (β„€β‰₯β€˜π‘) β†’ (0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)))
1816, 17syl 17 . . . . 5 (𝑁 ∈ (0...(β™―β€˜πΉ)) β†’ (0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)))
1918adantl 482 . . . 4 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)))
20 incom 4201 . . . . . 6 ((0..^𝑁) ∩ (0..^(β™―β€˜πΉ))) = ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁))
21 df-ss 3965 . . . . . . 7 ((0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)) ↔ ((0..^𝑁) ∩ (0..^(β™―β€˜πΉ))) = (0..^𝑁))
2221biimpi 215 . . . . . 6 ((0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)) β†’ ((0..^𝑁) ∩ (0..^(β™―β€˜πΉ))) = (0..^𝑁))
2320, 22eqtr3id 2786 . . . . 5 ((0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)) β†’ ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)) = (0..^𝑁))
2423fneq2d 6643 . . . 4 ((0..^𝑁) βŠ† (0..^(β™―β€˜πΉ)) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)) ↔ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn (0..^𝑁)))
2519, 24syl 17 . . 3 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn ((0..^(β™―β€˜πΉ)) ∩ (0..^𝑁)) ↔ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn (0..^𝑁)))
2615, 25mpbid 231 . 2 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) Fn (0..^𝑁))
27 wrdres 32141 . . . 4 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (𝐹 β†Ύ (0..^𝑁)) ∈ Word ℝ)
281, 2, 3, 4signstf 33646 . . . 4 ((𝐹 β†Ύ (0..^𝑁)) ∈ Word ℝ β†’ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) ∈ Word ℝ)
29 wrdf 14471 . . . 4 ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) ∈ Word ℝ β†’ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))):(0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))))βŸΆβ„)
30 ffn 6717 . . . 4 ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))):(0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))))βŸΆβ„ β†’ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) Fn (0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))))
3127, 28, 29, 304syl 19 . . 3 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) Fn (0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))))
321, 2, 3, 4signstlen 33647 . . . . . . 7 ((𝐹 β†Ύ (0..^𝑁)) ∈ Word ℝ β†’ (β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))) = (β™―β€˜(𝐹 β†Ύ (0..^𝑁))))
3327, 32syl 17 . . . . . 6 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))) = (β™―β€˜(𝐹 β†Ύ (0..^𝑁))))
34 wrdfn 14480 . . . . . . . 8 (𝐹 ∈ Word ℝ β†’ 𝐹 Fn (0..^(β™―β€˜πΉ)))
35 fnssres 6673 . . . . . . . 8 ((𝐹 Fn (0..^(β™―β€˜πΉ)) ∧ (0..^𝑁) βŠ† (0..^(β™―β€˜πΉ))) β†’ (𝐹 β†Ύ (0..^𝑁)) Fn (0..^𝑁))
3634, 18, 35syl2an 596 . . . . . . 7 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (𝐹 β†Ύ (0..^𝑁)) Fn (0..^𝑁))
37 hashfn 14337 . . . . . . 7 ((𝐹 β†Ύ (0..^𝑁)) Fn (0..^𝑁) β†’ (β™―β€˜(𝐹 β†Ύ (0..^𝑁))) = (β™―β€˜(0..^𝑁)))
3836, 37syl 17 . . . . . 6 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (β™―β€˜(𝐹 β†Ύ (0..^𝑁))) = (β™―β€˜(0..^𝑁)))
39 elfznn0 13596 . . . . . . . 8 (𝑁 ∈ (0...(β™―β€˜πΉ)) β†’ 𝑁 ∈ β„•0)
40 hashfzo0 14392 . . . . . . . 8 (𝑁 ∈ β„•0 β†’ (β™―β€˜(0..^𝑁)) = 𝑁)
4139, 40syl 17 . . . . . . 7 (𝑁 ∈ (0...(β™―β€˜πΉ)) β†’ (β™―β€˜(0..^𝑁)) = 𝑁)
4241adantl 482 . . . . . 6 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (β™―β€˜(0..^𝑁)) = 𝑁)
4333, 38, 423eqtrd 2776 . . . . 5 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))) = 𝑁)
4443oveq2d 7427 . . . 4 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))) = (0..^𝑁))
4544fneq2d 6643 . . 3 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) Fn (0..^(β™―β€˜(π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))) ↔ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) Fn (0..^𝑁)))
4631, 45mpbid 231 . 2 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))) Fn (0..^𝑁))
47 fvres 6910 . . . . 5 (π‘š ∈ (0..^𝑁) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁))β€˜π‘š) = ((π‘‡β€˜πΉ)β€˜π‘š))
4847ad3antlr 729 . . . 4 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁))β€˜π‘š) = ((π‘‡β€˜πΉ)β€˜π‘š))
49 simpr 485 . . . . . 6 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))
5049fveq2d 6895 . . . . 5 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ (π‘‡β€˜πΉ) = (π‘‡β€˜((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)))
5150fveq1d 6893 . . . 4 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ ((π‘‡β€˜πΉ)β€˜π‘š) = ((π‘‡β€˜((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))β€˜π‘š))
5227ad3antrrr 728 . . . . 5 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ (𝐹 β†Ύ (0..^𝑁)) ∈ Word ℝ)
53 simplr 767 . . . . 5 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ 𝑔 ∈ Word ℝ)
5438, 42eqtrd 2772 . . . . . . . . 9 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (β™―β€˜(𝐹 β†Ύ (0..^𝑁))) = 𝑁)
5554oveq2d 7427 . . . . . . . 8 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (0..^(β™―β€˜(𝐹 β†Ύ (0..^𝑁)))) = (0..^𝑁))
5655eleq2d 2819 . . . . . . 7 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ (π‘š ∈ (0..^(β™―β€˜(𝐹 β†Ύ (0..^𝑁)))) ↔ π‘š ∈ (0..^𝑁)))
5756biimpar 478 . . . . . 6 (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) β†’ π‘š ∈ (0..^(β™―β€˜(𝐹 β†Ύ (0..^𝑁)))))
5857ad2antrr 724 . . . . 5 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ π‘š ∈ (0..^(β™―β€˜(𝐹 β†Ύ (0..^𝑁)))))
591, 2, 3, 4signstfvc 33654 . . . . 5 (((𝐹 β†Ύ (0..^𝑁)) ∈ Word ℝ ∧ 𝑔 ∈ Word ℝ ∧ π‘š ∈ (0..^(β™―β€˜(𝐹 β†Ύ (0..^𝑁))))) β†’ ((π‘‡β€˜((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))β€˜π‘š) = ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))β€˜π‘š))
6052, 53, 58, 59syl3anc 1371 . . . 4 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ ((π‘‡β€˜((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))β€˜π‘š) = ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))β€˜π‘š))
6148, 51, 603eqtrd 2776 . . 3 (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔)) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁))β€˜π‘š) = ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))β€˜π‘š))
62 wrdsplex 32142 . . . 4 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ βˆƒπ‘” ∈ Word ℝ𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))
6362adantr 481 . . 3 (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) β†’ βˆƒπ‘” ∈ Word ℝ𝐹 = ((𝐹 β†Ύ (0..^𝑁)) ++ 𝑔))
6461, 63r19.29a 3162 . 2 (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) ∧ π‘š ∈ (0..^𝑁)) β†’ (((π‘‡β€˜πΉ) β†Ύ (0..^𝑁))β€˜π‘š) = ((π‘‡β€˜(𝐹 β†Ύ (0..^𝑁)))β€˜π‘š))
6526, 46, 64eqfnfvd 7035 1 ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(β™―β€˜πΉ))) β†’ ((π‘‡β€˜πΉ) β†Ύ (0..^𝑁)) = (π‘‡β€˜(𝐹 β†Ύ (0..^𝑁))))
Colors of variables: wff setvar class
Syntax hints:   β†’ wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106   β‰  wne 2940  βˆƒwrex 3070   ∩ cin 3947   βŠ† wss 3948  ifcif 4528  {cpr 4630  {ctp 4632  βŸ¨cop 4634   ↦ cmpt 5231   β†Ύ cres 5678   Fn wfn 6538  βŸΆwf 6539  β€˜cfv 6543  (class class class)co 7411   ∈ cmpo 7413  β„cr 11111  0cc0 11112  1c1 11113   βˆ’ cmin 11446  -cneg 11447  β„•0cn0 12474  β„€β‰₯cuz 12824  ...cfz 13486  ..^cfzo 13629  β™―chash 14292  Word cword 14466   ++ cconcat 14522  sgncsgn 15035  Ξ£csu 15634  ndxcnx 17128  Basecbs 17146  +gcplusg 17199   Ξ£g cgsu 17388
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727  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 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-tp 4633  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7367  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7858  df-1st 7977  df-2nd 7978  df-frecs 8268  df-wrecs 8299  df-recs 8373  df-rdg 8412  df-1o 8468  df-er 8705  df-en 8942  df-dom 8943  df-sdom 8944  df-fin 8945  df-card 9936  df-pnf 11252  df-mnf 11253  df-xr 11254  df-ltxr 11255  df-le 11256  df-sub 11448  df-neg 11449  df-nn 12215  df-2 12277  df-n0 12475  df-xnn0 12547  df-z 12561  df-uz 12825  df-fz 13487  df-fzo 13630  df-seq 13969  df-hash 14293  df-word 14467  df-lsw 14515  df-concat 14523  df-s1 14548  df-substr 14593  df-pfx 14623  df-sgn 15036  df-struct 17082  df-slot 17117  df-ndx 17129  df-base 17147  df-plusg 17212  df-0g 17389  df-gsum 17390  df-mgm 18563  df-sgrp 18612  df-mnd 18628
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator