signstres - Mathbox for Thierry Arnoux

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

Theorem signstres 34752

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.

Step	Hyp	Ref	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))
5	1, 2, 3, 4	signstf 34743	. . . . . . 7 ⊢ (𝐹 ∈ Word ℝ → (𝑇‘𝐹) ∈ Word ℝ)
6		wrdf 14453	. . . . . . 7 ⊢ ((𝑇‘𝐹) ∈ Word ℝ → (𝑇‘𝐹):(0..^(♯‘(𝑇‘𝐹)))⟶ℝ)
7		ffn 6670	. . . . . . 7 ⊢ ((𝑇‘𝐹):(0..^(♯‘(𝑇‘𝐹)))⟶ℝ → (𝑇‘𝐹) Fn (0..^(♯‘(𝑇‘𝐹))))
8	5, 6, 7	3syl 18	. . . . . 6 ⊢ (𝐹 ∈ Word ℝ → (𝑇‘𝐹) Fn (0..^(♯‘(𝑇‘𝐹))))
9	1, 2, 3, 4	signstlen 34744	. . . . . . . 8 ⊢ (𝐹 ∈ Word ℝ → (♯‘(𝑇‘𝐹)) = (♯‘𝐹))
10	9	oveq2d 7384	. . . . . . 7 ⊢ (𝐹 ∈ Word ℝ → (0..^(♯‘(𝑇‘𝐹))) = (0..^(♯‘𝐹)))
11	10	fneq2d 6594	. . . . . 6 ⊢ (𝐹 ∈ Word ℝ → ((𝑇‘𝐹) Fn (0..^(♯‘(𝑇‘𝐹))) ↔ (𝑇‘𝐹) Fn (0..^(♯‘𝐹))))
12	8, 11	mpbid 232	. . . . 5 ⊢ (𝐹 ∈ Word ℝ → (𝑇‘𝐹) Fn (0..^(♯‘𝐹)))
13		fnresin 32713	. . . . 5 ⊢ ((𝑇‘𝐹) Fn (0..^(♯‘𝐹)) → ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn ((0..^(♯‘𝐹)) ∩ (0..^𝑁)))
14	12, 13	syl 17	. . . 4 ⊢ (𝐹 ∈ Word ℝ → ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn ((0..^(♯‘𝐹)) ∩ (0..^𝑁)))
15	14	adantr 480	. . 3 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn ((0..^(♯‘𝐹)) ∩ (0..^𝑁)))
16		elfzuz3 13449	. . . . . 6 ⊢ (𝑁 ∈ (0...(♯‘𝐹)) → (♯‘𝐹) ∈ (ℤ_≥‘𝑁))
17		fzoss2 13615	. . . . . 6 ⊢ ((♯‘𝐹) ∈ (ℤ_≥‘𝑁) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
18	16, 17	syl 17	. . . . 5 ⊢ (𝑁 ∈ (0...(♯‘𝐹)) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
19	18	adantl 481	. . . 4 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (0..^𝑁) ⊆ (0..^(♯‘𝐹)))
20		incom 4163	. . . . . 6 ⊢ ((0..^𝑁) ∩ (0..^(♯‘𝐹))) = ((0..^(♯‘𝐹)) ∩ (0..^𝑁))
21		dfss2 3921	. . . . . . 7 ⊢ ((0..^𝑁) ⊆ (0..^(♯‘𝐹)) ↔ ((0..^𝑁) ∩ (0..^(♯‘𝐹))) = (0..^𝑁))
22	21	biimpi 216	. . . . . 6 ⊢ ((0..^𝑁) ⊆ (0..^(♯‘𝐹)) → ((0..^𝑁) ∩ (0..^(♯‘𝐹))) = (0..^𝑁))
23	20, 22	eqtr3id 2786	. . . . 5 ⊢ ((0..^𝑁) ⊆ (0..^(♯‘𝐹)) → ((0..^(♯‘𝐹)) ∩ (0..^𝑁)) = (0..^𝑁))
24	23	fneq2d 6594	. . . 4 ⊢ ((0..^𝑁) ⊆ (0..^(♯‘𝐹)) → (((𝑇‘𝐹) ↾ (0..^𝑁)) Fn ((0..^(♯‘𝐹)) ∩ (0..^𝑁)) ↔ ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn (0..^𝑁)))
25	19, 24	syl 17	. . 3 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (((𝑇‘𝐹) ↾ (0..^𝑁)) Fn ((0..^(♯‘𝐹)) ∩ (0..^𝑁)) ↔ ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn (0..^𝑁)))
26	15, 25	mpbid 232	. 2 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → ((𝑇‘𝐹) ↾ (0..^𝑁)) Fn (0..^𝑁))
27		wrdres 33027	. . . 4 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)) ∈ Word ℝ)
28	1, 2, 3, 4	signstf 34743	. . . 4 ⊢ ((𝐹 ↾ (0..^𝑁)) ∈ Word ℝ → (𝑇‘(𝐹 ↾ (0..^𝑁))) ∈ Word ℝ)
29		wrdf 14453	. . . 4 ⊢ ((𝑇‘(𝐹 ↾ (0..^𝑁))) ∈ Word ℝ → (𝑇‘(𝐹 ↾ (0..^𝑁))):(0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁)))))⟶ℝ)
30		ffn 6670	. . . 4 ⊢ ((𝑇‘(𝐹 ↾ (0..^𝑁))):(0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁)))))⟶ℝ → (𝑇‘(𝐹 ↾ (0..^𝑁))) Fn (0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁))))))
31	27, 28, 29, 30	4syl 19	. . 3 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝑇‘(𝐹 ↾ (0..^𝑁))) Fn (0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁))))))
32	1, 2, 3, 4	signstlen 34744	. . . . . . 7 ⊢ ((𝐹 ↾ (0..^𝑁)) ∈ Word ℝ → (♯‘(𝑇‘(𝐹 ↾ (0..^𝑁)))) = (♯‘(𝐹 ↾ (0..^𝑁))))
33	27, 32	syl 17	. . . . . 6 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝑇‘(𝐹 ↾ (0..^𝑁)))) = (♯‘(𝐹 ↾ (0..^𝑁))))
34		wrdfn 14463	. . . . . . . 8 ⊢ (𝐹 ∈ Word ℝ → 𝐹 Fn (0..^(♯‘𝐹)))
35		fnssres 6623	. . . . . . . 8 ⊢ ((𝐹 Fn (0..^(♯‘𝐹)) ∧ (0..^𝑁) ⊆ (0..^(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)) Fn (0..^𝑁))
36	34, 18, 35	syl2an 597	. . . . . . 7 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝐹 ↾ (0..^𝑁)) Fn (0..^𝑁))
37		hashfn 14310	. . . . . . 7 ⊢ ((𝐹 ↾ (0..^𝑁)) Fn (0..^𝑁) → (♯‘(𝐹 ↾ (0..^𝑁))) = (♯‘(0..^𝑁)))
38	36, 37	syl 17	. . . . . 6 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 ↾ (0..^𝑁))) = (♯‘(0..^𝑁)))
39		elfznn0 13548	. . . . . . . 8 ⊢ (𝑁 ∈ (0...(♯‘𝐹)) → 𝑁 ∈ ℕ₀)
40		hashfzo0 14365	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ₀ → (♯‘(0..^𝑁)) = 𝑁)
41	39, 40	syl 17	. . . . . . 7 ⊢ (𝑁 ∈ (0...(♯‘𝐹)) → (♯‘(0..^𝑁)) = 𝑁)
42	41	adantl 481	. . . . . 6 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(0..^𝑁)) = 𝑁)
43	33, 38, 42	3eqtrd 2776	. . . . 5 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝑇‘(𝐹 ↾ (0..^𝑁)))) = 𝑁)
44	43	oveq2d 7384	. . . 4 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁))))) = (0..^𝑁))
45	44	fneq2d 6594	. . 3 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → ((𝑇‘(𝐹 ↾ (0..^𝑁))) Fn (0..^(♯‘(𝑇‘(𝐹 ↾ (0..^𝑁))))) ↔ (𝑇‘(𝐹 ↾ (0..^𝑁))) Fn (0..^𝑁)))
46	31, 45	mpbid 232	. 2 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝑇‘(𝐹 ↾ (0..^𝑁))) Fn (0..^𝑁))
47		fvres 6861	. . . . 5 ⊢ (𝑚 ∈ (0..^𝑁) → (((𝑇‘𝐹) ↾ (0..^𝑁))‘𝑚) = ((𝑇‘𝐹)‘𝑚))
48	47	ad3antlr 732	. . . 4 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → (((𝑇‘𝐹) ↾ (0..^𝑁))‘𝑚) = ((𝑇‘𝐹)‘𝑚))
49		simpr 484	. . . . . 6 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔))
50	49	fveq2d 6846	. . . . 5 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → (𝑇‘𝐹) = (𝑇‘((𝐹 ↾ (0..^𝑁)) ++ 𝑔)))
51	50	fveq1d 6844	. . . 4 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → ((𝑇‘𝐹)‘𝑚) = ((𝑇‘((𝐹 ↾ (0..^𝑁)) ++ 𝑔))‘𝑚))
52	27	ad3antrrr 731	. . . . 5 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → (𝐹 ↾ (0..^𝑁)) ∈ Word ℝ)
53		simplr 769	. . . . 5 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → 𝑔 ∈ Word ℝ)
54	38, 42	eqtrd 2772	. . . . . . . . 9 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (♯‘(𝐹 ↾ (0..^𝑁))) = 𝑁)
55	54	oveq2d 7384	. . . . . . . 8 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (0..^(♯‘(𝐹 ↾ (0..^𝑁)))) = (0..^𝑁))
56	55	eleq2d 2823	. . . . . . 7 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → (𝑚 ∈ (0..^(♯‘(𝐹 ↾ (0..^𝑁)))) ↔ 𝑚 ∈ (0..^𝑁)))
57	56	biimpar 477	. . . . . 6 ⊢ (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) → 𝑚 ∈ (0..^(♯‘(𝐹 ↾ (0..^𝑁)))))
58	57	ad2antrr 727	. . . . 5 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → 𝑚 ∈ (0..^(♯‘(𝐹 ↾ (0..^𝑁)))))
59	1, 2, 3, 4	signstfvc 34751	. . . . 5 ⊢ (((𝐹 ↾ (0..^𝑁)) ∈ Word ℝ ∧ 𝑔 ∈ Word ℝ ∧ 𝑚 ∈ (0..^(♯‘(𝐹 ↾ (0..^𝑁))))) → ((𝑇‘((𝐹 ↾ (0..^𝑁)) ++ 𝑔))‘𝑚) = ((𝑇‘(𝐹 ↾ (0..^𝑁)))‘𝑚))
60	52, 53, 58, 59	syl3anc 1374	. . . 4 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → ((𝑇‘((𝐹 ↾ (0..^𝑁)) ++ 𝑔))‘𝑚) = ((𝑇‘(𝐹 ↾ (0..^𝑁)))‘𝑚))
61	48, 51, 60	3eqtrd 2776	. . 3 ⊢ (((((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) ∧ 𝑔 ∈ Word ℝ) ∧ 𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔)) → (((𝑇‘𝐹) ↾ (0..^𝑁))‘𝑚) = ((𝑇‘(𝐹 ↾ (0..^𝑁)))‘𝑚))
62		wrdsplex 33028	. . . 4 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → ∃𝑔 ∈ Word ℝ𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔))
63	62	adantr 480	. . 3 ⊢ (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) → ∃𝑔 ∈ Word ℝ𝐹 = ((𝐹 ↾ (0..^𝑁)) ++ 𝑔))
64	61, 63	r19.29a 3146	. 2 ⊢ (((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) ∧ 𝑚 ∈ (0..^𝑁)) → (((𝑇‘𝐹) ↾ (0..^𝑁))‘𝑚) = ((𝑇‘(𝐹 ↾ (0..^𝑁)))‘𝑚))
65	26, 46, 64	eqfnfvd 6988	1 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝑁 ∈ (0...(♯‘𝐹))) → ((𝑇‘𝐹) ↾ (0..^𝑁)) = (𝑇‘(𝐹 ↾ (0..^𝑁))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∃wrex 3062 ∩ cin 3902 ⊆ wss 3903 ifcif 4481 {cpr 4584 {ctp 4586 ⟨cop 4588 ↦ cmpt 5181 ↾ cres 5634 Fn wfn 6495 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 ℝcr 11037 0cc0 11038 1c1 11039 − cmin 11376 -cneg 11377 ℕ₀cn0 12413 ℤ_≥cuz 12763 ...cfz 13435 ..^cfzo 13582 ♯chash 14265 Word cword 14448 ++ cconcat 14505 sgncsgn 15021 Σcsu 15621 ndxcnx 17132 Basecbs 17148 +_gcplusg 17189 Σ_g cgsu 17372

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 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-n0 12414 df-xnn0 12487 df-z 12501 df-uz 12764 df-fz 13436 df-fzo 13583 df-seq 13937 df-hash 14266 df-word 14449 df-lsw 14498 df-concat 14506 df-s1 14532 df-substr 14577 df-pfx 14607 df-sgn 15022 df-struct 17086 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-0g 17373 df-gsum 17374 df-mgm 18577 df-sgrp 18656 df-mnd 18672

This theorem is referenced by: (None)

W3C validator