seq3f1olemstep - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > seq3f1olemstep		GIF version

Theorem seq3f1olemstep 10585

Description: Lemma for seq3f1o 10588. Given a permutation which is constant up to a point, supply a new one which is constant for one more position. (Contributed by Jim Kingdon, 19-Aug-2022.)

**Hypotheses**
Ref	Expression
iseqf1o.1	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
iseqf1o.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
iseqf1o.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
iseqf1o.4	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
iseqf1o.6	⊢ (𝜑 → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
iseqf1o.7	⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ_≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
iseqf1olemstep.k	⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁))
iseqf1olemstep.j	⊢ (𝜑 → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
iseqf1olemstep.const	⊢ (𝜑 → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽‘𝑥) = 𝑥)
seq3f1olemstep.jp	⊢ (𝜑 → (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
seq3f1olemstep.p	⊢ 𝑃 = (𝑥 ∈ (ℤ_≥‘𝑀) ↦ if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))

**Assertion**
Ref	Expression
seq3f1olemstep	⊢ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))

Distinct variable groups: + ,𝑓,𝑥,𝑦,𝑧 𝑓,𝐽,𝑥,𝑦,𝑧 𝑓,𝐾,𝑥,𝑦,𝑧 𝑓,𝐿 𝑓,𝑀,𝑥,𝑦,𝑧 𝑓,𝑁,𝑥,𝑦,𝑧 𝑆,𝑓,𝑥,𝑦,𝑧 𝜑,𝑥,𝑦,𝑧 𝑥,𝑃,𝑦,𝑧 𝑓,𝐺,𝑥 Allowed substitution hints: 𝜑(𝑓) 𝑃(𝑓) 𝐹(𝑥,𝑦,𝑧,𝑓) 𝐺(𝑦,𝑧) 𝐿(𝑥,𝑦,𝑧)

Proof of Theorem seq3f1olemstep Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iseqf1olemstep.j	. . . . . 6 ⊢ (𝜑 → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
2		f1of 5500	. . . . . 6 ⊢ (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
3	1, 2	syl 14	. . . . 5 ⊢ (𝜑 → 𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
4		iseqf1olemstep.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝑀...𝑁))
5		elfzel1 10090	. . . . . . 7 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
6	4, 5	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
7		elfzel2 10089	. . . . . . 7 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ)
8	4, 7	syl 14	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ ℤ)
9	6, 8	fzfigd 10502	. . . . 5 ⊢ (𝜑 → (𝑀...𝑁) ∈ Fin)
10		fex 5787	. . . . 5 ⊢ ((𝐽:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → 𝐽 ∈ V)
11	3, 9, 10	syl2anc 411	. . . 4 ⊢ (𝜑 → 𝐽 ∈ V)
12	11	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → 𝐽 ∈ V)
13	1	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
14		iseqf1olemstep.const	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽‘𝑥) = 𝑥)
15	14	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽‘𝑥) = 𝑥)
16		eqcom 2195	. . . . . . . . . 10 ⊢ (𝐾 = (^◡𝐽‘𝐾) ↔ (^◡𝐽‘𝐾) = 𝐾)
17	16	biimpi 120	. . . . . . . . 9 ⊢ (𝐾 = (^◡𝐽‘𝐾) → (^◡𝐽‘𝐾) = 𝐾)
18	17	adantl 277	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (^◡𝐽‘𝐾) = 𝐾)
19		f1ocnvfvb 5823	. . . . . . . . . 10 ⊢ ((𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ 𝐾 ∈ (𝑀...𝑁) ∧ 𝐾 ∈ (𝑀...𝑁)) → ((𝐽‘𝐾) = 𝐾 ↔ (^◡𝐽‘𝐾) = 𝐾))
20	1, 4, 4, 19	syl3anc 1249	. . . . . . . . 9 ⊢ (𝜑 → ((𝐽‘𝐾) = 𝐾 ↔ (^◡𝐽‘𝐾) = 𝐾))
21	20	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ((𝐽‘𝐾) = 𝐾 ↔ (^◡𝐽‘𝐾) = 𝐾))
22	18, 21	mpbird 167	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (𝐽‘𝐾) = 𝐾)
23		elfzelz 10091	. . . . . . . . . 10 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ ℤ)
24	4, 23	syl 14	. . . . . . . . 9 ⊢ (𝜑 → 𝐾 ∈ ℤ)
25	24	adantr 276	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → 𝐾 ∈ ℤ)
26		fveq2 5554	. . . . . . . . . 10 ⊢ (𝑥 = 𝐾 → (𝐽‘𝑥) = (𝐽‘𝐾))
27		id 19	. . . . . . . . . 10 ⊢ (𝑥 = 𝐾 → 𝑥 = 𝐾)
28	26, 27	eqeq12d 2208	. . . . . . . . 9 ⊢ (𝑥 = 𝐾 → ((𝐽‘𝑥) = 𝑥 ↔ (𝐽‘𝐾) = 𝐾))
29	28	ralsng 3658	. . . . . . . 8 ⊢ (𝐾 ∈ ℤ → (∀𝑥 ∈ {𝐾} (𝐽‘𝑥) = 𝑥 ↔ (𝐽‘𝐾) = 𝐾))
30	25, 29	syl 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (∀𝑥 ∈ {𝐾} (𝐽‘𝑥) = 𝑥 ↔ (𝐽‘𝐾) = 𝐾))
31	22, 30	mpbird 167	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ {𝐾} (𝐽‘𝑥) = 𝑥)
32		ralun 3341	. . . . . 6 ⊢ ((∀𝑥 ∈ (𝑀..^𝐾)(𝐽‘𝑥) = 𝑥 ∧ ∀𝑥 ∈ {𝐾} (𝐽‘𝑥) = 𝑥) → ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽‘𝑥) = 𝑥)
33	15, 31, 32	syl2anc 411	. . . . 5 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽‘𝑥) = 𝑥)
34		elfzuz 10087	. . . . . . . 8 ⊢ (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ (ℤ_≥‘𝑀))
35		fzisfzounsn 10303	. . . . . . . 8 ⊢ (𝐾 ∈ (ℤ_≥‘𝑀) → (𝑀...𝐾) = ((𝑀..^𝐾) ∪ {𝐾}))
36	4, 34, 35	3syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑀...𝐾) = ((𝑀..^𝐾) ∪ {𝐾}))
37	36	raleqdv 2696	. . . . . 6 ⊢ (𝜑 → (∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ↔ ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽‘𝑥) = 𝑥))
38	37	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ↔ ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽‘𝑥) = 𝑥))
39	33, 38	mpbird 167	. . . 4 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥)
40		seq3f1olemstep.jp	. . . . 5 ⊢ (𝜑 → (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
41	40	adantr 276	. . . 4 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
42	13, 39, 41	3jca 1179	. . 3 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
43		nfcv 2336	. . . 4 ⊢ Ⅎ𝑓𝐽
44		nfv 1539	. . . . 5 ⊢ Ⅎ𝑓 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
45		nfv 1539	. . . . 5 ⊢ Ⅎ𝑓∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥
46		nfcv 2336	. . . . . . . 8 ⊢ Ⅎ𝑓𝑀
47		nfcv 2336	. . . . . . . 8 ⊢ Ⅎ𝑓 +
48		nfcsb1v 3113	. . . . . . . 8 ⊢ Ⅎ𝑓⦋𝐽 / 𝑓⦌𝑃
49	46, 47, 48	nfseq 10528	. . . . . . 7 ⊢ Ⅎ𝑓seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)
50		nfcv 2336	. . . . . . 7 ⊢ Ⅎ𝑓𝑁
51	49, 50	nffv 5564	. . . . . 6 ⊢ Ⅎ𝑓(seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁)
52	51	nfeq1 2346	. . . . 5 ⊢ Ⅎ𝑓(seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
53	44, 45, 52	nf3an 1577	. . . 4 ⊢ Ⅎ𝑓(𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
54		f1oeq1 5488	. . . . 5 ⊢ (𝑓 = 𝐽 → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
55		fveq1 5553	. . . . . . 7 ⊢ (𝑓 = 𝐽 → (𝑓‘𝑥) = (𝐽‘𝑥))
56	55	eqeq1d 2202	. . . . . 6 ⊢ (𝑓 = 𝐽 → ((𝑓‘𝑥) = 𝑥 ↔ (𝐽‘𝑥) = 𝑥))
57	56	ralbidv 2494	. . . . 5 ⊢ (𝑓 = 𝐽 → (∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥))
58		csbeq1a 3089	. . . . . . . 8 ⊢ (𝑓 = 𝐽 → 𝑃 = ⦋𝐽 / 𝑓⦌𝑃)
59	58	seqeq3d 10526	. . . . . . 7 ⊢ (𝑓 = 𝐽 → seq𝑀( + , 𝑃) = seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃))
60	59	fveq1d 5556	. . . . . 6 ⊢ (𝑓 = 𝐽 → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁))
61	60	eqeq1d 2202	. . . . 5 ⊢ (𝑓 = 𝐽 → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
62	54, 57, 61	3anbi123d 1323	. . . 4 ⊢ (𝑓 = 𝐽 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
63	43, 53, 62	spcegf 2843	. . 3 ⊢ (𝐽 ∈ V → ((𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
64	12, 42, 63	sylc 62	. 2 ⊢ ((𝜑 ∧ 𝐾 = (^◡𝐽‘𝐾)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
65	4	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝐾 ∈ (𝑀...𝑁))
66	1	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
67		eqid 2193	. . . 4 ⊢ (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))
68	65, 66, 67	iseqf1olemqf1o 10577	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
69	14	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽‘𝑥) = 𝑥)
70	65, 66, 67, 69	iseqf1olemqk 10578	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥)
71		iseqf1o.1	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
72	71	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
73		iseqf1o.2	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
74	73	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
75		iseqf1o.3	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
76	75	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆 ∧ 𝑧 ∈ 𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
77		iseqf1o.4	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
78	77	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝑁 ∈ (ℤ_≥‘𝑀))
79		iseqf1o.6	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
80	79	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
81		iseqf1o.7	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (ℤ_≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
82	81	adantlr 477	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) ∧ 𝑥 ∈ (ℤ_≥‘𝑀)) → (𝐺‘𝑥) ∈ 𝑆)
83		neqne 2372	. . . . . 6 ⊢ (¬ 𝐾 = (^◡𝐽‘𝐾) → 𝐾 ≠ (^◡𝐽‘𝐾))
84	83	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝐾 ≠ (^◡𝐽‘𝐾))
85		seq3f1olemstep.p	. . . . 5 ⊢ 𝑃 = (𝑥 ∈ (ℤ_≥‘𝑀) ↦ if(𝑥 ≤ 𝑁, (𝐺‘(𝑓‘𝑥)), (𝐺‘𝑀)))
86	72, 74, 76, 78, 80, 82, 65, 66, 69, 84, 67, 85	seq3f1olemqsum 10584	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁))
87	40	adantr 276	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (seq𝑀( + , ⦋𝐽 / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
88	86, 87	eqtr3d 2228	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
89	65, 5	syl 14	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝑀 ∈ ℤ)
90	65, 7	syl 14	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → 𝑁 ∈ ℤ)
91	89, 90	fzfigd 10502	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (𝑀...𝑁) ∈ Fin)
92		mptexg 5783	. . . 4 ⊢ ((𝑀...𝑁) ∈ Fin → (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) ∈ V)
93		nfcv 2336	. . . . 5 ⊢ Ⅎ𝑓(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))
94		nfv 1539	. . . . . 6 ⊢ Ⅎ𝑓(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
95		nfv 1539	. . . . . 6 ⊢ Ⅎ𝑓∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥
96		nfcsb1v 3113	. . . . . . . . 9 ⊢ Ⅎ𝑓⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃
97	46, 47, 96	nfseq 10528	. . . . . . . 8 ⊢ Ⅎ𝑓seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)
98	97, 50	nffv 5564	. . . . . . 7 ⊢ Ⅎ𝑓(seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁)
99	98	nfeq1 2346	. . . . . 6 ⊢ Ⅎ𝑓(seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
100	94, 95, 99	nf3an 1577	. . . . 5 ⊢ Ⅎ𝑓((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
101		f1oeq1 5488	. . . . . 6 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
102		fveq1 5553	. . . . . . . 8 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → (𝑓‘𝑥) = ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥))
103	102	eqeq1d 2202	. . . . . . 7 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → ((𝑓‘𝑥) = 𝑥 ↔ ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥))
104	103	ralbidv 2494	. . . . . 6 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → (∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥))
105		csbeq1a 3089	. . . . . . . . 9 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → 𝑃 = ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)
106	105	seqeq3d 10526	. . . . . . . 8 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → seq𝑀( + , 𝑃) = seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃))
107	106	fveq1d 5556	. . . . . . 7 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁))
108	107	eqeq1d 2202	. . . . . 6 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
109	101, 104, 108	3anbi123d 1323	. . . . 5 ⊢ (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
110	93, 100, 109	spcegf 2843	. . . 4 ⊢ ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) ∈ V → (((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
111	91, 92, 110	3syl 17	. . 3 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → (((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , ⦋(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(^◡𝐽‘𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽‘𝑢))) / 𝑓⦌𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
112	68, 70, 88, 111	mp3and 1351	. 2 ⊢ ((𝜑 ∧ ¬ 𝐾 = (^◡𝐽‘𝐾)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
113		f1ocnv 5513	. . . . . . 7 ⊢ (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → ^◡𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
114		f1of 5500	. . . . . . 7 ⊢ (^◡𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → ^◡𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
115	1, 113, 114	3syl 17	. . . . . 6 ⊢ (𝜑 → ^◡𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
116	115, 4	ffvelcdmd 5694	. . . . 5 ⊢ (𝜑 → (^◡𝐽‘𝐾) ∈ (𝑀...𝑁))
117		elfzelz 10091	. . . . 5 ⊢ ((^◡𝐽‘𝐾) ∈ (𝑀...𝑁) → (^◡𝐽‘𝐾) ∈ ℤ)
118	116, 117	syl 14	. . . 4 ⊢ (𝜑 → (^◡𝐽‘𝐾) ∈ ℤ)
119		zdceq 9392	. . . 4 ⊢ ((𝐾 ∈ ℤ ∧ (^◡𝐽‘𝐾) ∈ ℤ) → DECID 𝐾 = (^◡𝐽‘𝐾))
120	24, 118, 119	syl2anc 411	. . 3 ⊢ (𝜑 → DECID 𝐾 = (^◡𝐽‘𝐾))
121		exmiddc 837	. . 3 ⊢ (DECID 𝐾 = (^◡𝐽‘𝐾) → (𝐾 = (^◡𝐽‘𝐾) ∨ ¬ 𝐾 = (^◡𝐽‘𝐾)))
122	120, 121	syl 14	. 2 ⊢ (𝜑 → (𝐾 = (^◡𝐽‘𝐾) ∨ ¬ 𝐾 = (^◡𝐽‘𝐾)))
123	64, 112, 122	mpjaodan 799	1 ⊢ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓‘𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∧ w3a 980 = wceq 1364 ∃wex 1503 ∈ wcel 2164 ≠ wne 2364 ∀wral 2472 Vcvv 2760 ⦋csb 3080 ∪ cun 3151 ifcif 3557 {csn 3618 class class class wbr 4029 ↦ cmpt 4090 ^◡ccnv 4658 ⟶wf 5250 –1-1-onto→wf1o 5253 ‘cfv 5254 (class class class)co 5918 Fincfn 6794 1c1 7873 ≤ cle 8055 − cmin 8190 ℤcz 9317 ℤ_≥cuz 9592 ...cfz 10074 ..^cfzo 10208 seqcseq 10518

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-nul 4155 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-iinf 4620 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-distr 7976 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-cnre 7983 ax-pre-ltirr 7984 ax-pre-ltwlin 7985 ax-pre-lttrn 7986 ax-pre-apti 7987 ax-pre-ltadd 7988

This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-if 3558 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-tr 4128 df-id 4324 df-iord 4397 df-on 4399 df-ilim 4400 df-suc 4402 df-iom 4623 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-recs 6358 df-frec 6444 df-1o 6469 df-er 6587 df-en 6795 df-fin 6797 df-pnf 8056 df-mnf 8057 df-xr 8058 df-ltxr 8059 df-le 8060 df-sub 8192 df-neg 8193 df-inn 8983 df-n0 9241 df-z 9318 df-uz 9593 df-fz 10075 df-fzo 10209 df-seqfrec 10519

This theorem is referenced by: seq3f1olemp 10586

W3C validator