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

Theorem seq3f1olemstep 10883
Description: Lemma for seq3f1o 10886. 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.
StepHypRef Expression
1 iseqf1olemstep.j . . . . . 6 (𝜑𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
2 f1of 5616 . . . . . 6 (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
31, 2syl 14 . . . . 5 (𝜑𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
4 iseqf1olemstep.k . . . . . . 7 (𝜑𝐾 ∈ (𝑀...𝑁))
5 elfzel1 10364 . . . . . . 7 (𝐾 ∈ (𝑀...𝑁) → 𝑀 ∈ ℤ)
64, 5syl 14 . . . . . 6 (𝜑𝑀 ∈ ℤ)
7 elfzel2 10363 . . . . . . 7 (𝐾 ∈ (𝑀...𝑁) → 𝑁 ∈ ℤ)
84, 7syl 14 . . . . . 6 (𝜑𝑁 ∈ ℤ)
96, 8fzfigd 10800 . . . . 5 (𝜑 → (𝑀...𝑁) ∈ Fin)
10 fex 5917 . . . . 5 ((𝐽:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → 𝐽 ∈ V)
113, 9, 10syl2anc 411 . . . 4 (𝜑𝐽 ∈ V)
1211adantr 276 . . 3 ((𝜑𝐾 = (𝐽𝐾)) → 𝐽 ∈ V)
131adantr 276 . . . 4 ((𝜑𝐾 = (𝐽𝐾)) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
14 iseqf1olemstep.const . . . . . . 7 (𝜑 → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽𝑥) = 𝑥)
1514adantr 276 . . . . . 6 ((𝜑𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽𝑥) = 𝑥)
16 eqcom 2236 . . . . . . . . . 10 (𝐾 = (𝐽𝐾) ↔ (𝐽𝐾) = 𝐾)
1716biimpi 120 . . . . . . . . 9 (𝐾 = (𝐽𝐾) → (𝐽𝐾) = 𝐾)
1817adantl 277 . . . . . . . 8 ((𝜑𝐾 = (𝐽𝐾)) → (𝐽𝐾) = 𝐾)
19 f1ocnvfvb 5955 . . . . . . . . . 10 ((𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ 𝐾 ∈ (𝑀...𝑁) ∧ 𝐾 ∈ (𝑀...𝑁)) → ((𝐽𝐾) = 𝐾 ↔ (𝐽𝐾) = 𝐾))
201, 4, 4, 19syl3anc 1274 . . . . . . . . 9 (𝜑 → ((𝐽𝐾) = 𝐾 ↔ (𝐽𝐾) = 𝐾))
2120adantr 276 . . . . . . . 8 ((𝜑𝐾 = (𝐽𝐾)) → ((𝐽𝐾) = 𝐾 ↔ (𝐽𝐾) = 𝐾))
2218, 21mpbird 167 . . . . . . 7 ((𝜑𝐾 = (𝐽𝐾)) → (𝐽𝐾) = 𝐾)
23 elfzelz 10365 . . . . . . . . . 10 (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ ℤ)
244, 23syl 14 . . . . . . . . 9 (𝜑𝐾 ∈ ℤ)
2524adantr 276 . . . . . . . 8 ((𝜑𝐾 = (𝐽𝐾)) → 𝐾 ∈ ℤ)
26 fveq2 5672 . . . . . . . . . 10 (𝑥 = 𝐾 → (𝐽𝑥) = (𝐽𝐾))
27 id 19 . . . . . . . . . 10 (𝑥 = 𝐾𝑥 = 𝐾)
2826, 27eqeq12d 2249 . . . . . . . . 9 (𝑥 = 𝐾 → ((𝐽𝑥) = 𝑥 ↔ (𝐽𝐾) = 𝐾))
2928ralsng 3731 . . . . . . . 8 (𝐾 ∈ ℤ → (∀𝑥 ∈ {𝐾} (𝐽𝑥) = 𝑥 ↔ (𝐽𝐾) = 𝐾))
3025, 29syl 14 . . . . . . 7 ((𝜑𝐾 = (𝐽𝐾)) → (∀𝑥 ∈ {𝐾} (𝐽𝑥) = 𝑥 ↔ (𝐽𝐾) = 𝐾))
3122, 30mpbird 167 . . . . . 6 ((𝜑𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ {𝐾} (𝐽𝑥) = 𝑥)
32 ralun 3403 . . . . . 6 ((∀𝑥 ∈ (𝑀..^𝐾)(𝐽𝑥) = 𝑥 ∧ ∀𝑥 ∈ {𝐾} (𝐽𝑥) = 𝑥) → ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽𝑥) = 𝑥)
3315, 31, 32syl2anc 411 . . . . 5 ((𝜑𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽𝑥) = 𝑥)
34 elfzuz 10361 . . . . . . . 8 (𝐾 ∈ (𝑀...𝑁) → 𝐾 ∈ (ℤ𝑀))
35 fzisfzounsn 10589 . . . . . . . 8 (𝐾 ∈ (ℤ𝑀) → (𝑀...𝐾) = ((𝑀..^𝐾) ∪ {𝐾}))
364, 34, 353syl 17 . . . . . . 7 (𝜑 → (𝑀...𝐾) = ((𝑀..^𝐾) ∪ {𝐾}))
3736raleqdv 2749 . . . . . 6 (𝜑 → (∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ↔ ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽𝑥) = 𝑥))
3837adantr 276 . . . . 5 ((𝜑𝐾 = (𝐽𝐾)) → (∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ↔ ∀𝑥 ∈ ((𝑀..^𝐾) ∪ {𝐾})(𝐽𝑥) = 𝑥))
3933, 38mpbird 167 . . . 4 ((𝜑𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥)
40 seq3f1olemstep.jp . . . . 5 (𝜑 → (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
4140adantr 276 . . . 4 ((𝜑𝐾 = (𝐽𝐾)) → (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
4213, 39, 413jca 1204 . . 3 ((𝜑𝐾 = (𝐽𝐾)) → (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ∧ (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
43 nfcv 2386 . . . 4 𝑓𝐽
44 nfv 1577 . . . . 5 𝑓 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
45 nfv 1577 . . . . 5 𝑓𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥
46 nfcv 2386 . . . . . . . 8 𝑓𝑀
47 nfcv 2386 . . . . . . . 8 𝑓 +
48 nfcsb1v 3173 . . . . . . . 8 𝑓𝐽 / 𝑓𝑃
4946, 47, 48nfseq 10826 . . . . . . 7 𝑓seq𝑀( + , 𝐽 / 𝑓𝑃)
50 nfcv 2386 . . . . . . 7 𝑓𝑁
5149, 50nffv 5682 . . . . . 6 𝑓(seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁)
5251nfeq1 2396 . . . . 5 𝑓(seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
5344, 45, 52nf3an 1615 . . . 4 𝑓(𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ∧ (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
54 f1oeq1 5604 . . . . 5 (𝑓 = 𝐽 → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
55 fveq1 5671 . . . . . . 7 (𝑓 = 𝐽 → (𝑓𝑥) = (𝐽𝑥))
5655eqeq1d 2243 . . . . . 6 (𝑓 = 𝐽 → ((𝑓𝑥) = 𝑥 ↔ (𝐽𝑥) = 𝑥))
5756ralbidv 2544 . . . . 5 (𝑓 = 𝐽 → (∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥))
58 csbeq1a 3149 . . . . . . . 8 (𝑓 = 𝐽𝑃 = 𝐽 / 𝑓𝑃)
5958seqeq3d 10824 . . . . . . 7 (𝑓 = 𝐽 → seq𝑀( + , 𝑃) = seq𝑀( + , 𝐽 / 𝑓𝑃))
6059fveq1d 5674 . . . . . 6 (𝑓 = 𝐽 → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁))
6160eqeq1d 2243 . . . . 5 (𝑓 = 𝐽 → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
6254, 57, 613anbi123d 1349 . . . 4 (𝑓 = 𝐽 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ∧ (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
6343, 53, 62spcegf 2902 . . 3 (𝐽 ∈ V → ((𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝐽𝑥) = 𝑥 ∧ (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
6412, 42, 63sylc 62 . 2 ((𝜑𝐾 = (𝐽𝐾)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
654adantr 276 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝐾 ∈ (𝑀...𝑁))
661adantr 276 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
67 eqid 2234 . . . 4 (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))
6865, 66, 67iseqf1olemqf1o 10875 . . 3 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
6914adantr 276 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ (𝑀..^𝐾)(𝐽𝑥) = 𝑥)
7065, 66, 67, 69iseqf1olemqk 10876 . . 3 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥)
71 iseqf1o.1 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
7271adantlr 477 . . . . 5 (((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
73 iseqf1o.2 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
7473adantlr 477 . . . . 5 (((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
75 iseqf1o.3 . . . . . 6 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
7675adantlr 477 . . . . 5 (((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
77 iseqf1o.4 . . . . . 6 (𝜑𝑁 ∈ (ℤ𝑀))
7877adantr 276 . . . . 5 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝑁 ∈ (ℤ𝑀))
79 iseqf1o.6 . . . . . 6 (𝜑𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
8079adantr 276 . . . . 5 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
81 iseqf1o.7 . . . . . 6 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
8281adantlr 477 . . . . 5 (((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
83 neqne 2422 . . . . . 6 𝐾 = (𝐽𝐾) → 𝐾 ≠ (𝐽𝐾))
8483adantl 277 . . . . 5 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝐾 ≠ (𝐽𝐾))
85 seq3f1olemstep.p . . . . 5 𝑃 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)))
8672, 74, 76, 78, 80, 82, 65, 66, 69, 84, 67, 85seq3f1olemqsum 10882 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁))
8740adantr 276 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (seq𝑀( + , 𝐽 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
8886, 87eqtr3d 2269 . . 3 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
8965, 5syl 14 . . . . 5 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝑀 ∈ ℤ)
9065, 7syl 14 . . . . 5 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → 𝑁 ∈ ℤ)
9189, 90fzfigd 10800 . . . 4 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (𝑀...𝑁) ∈ Fin)
92 mptexg 5913 . . . 4 ((𝑀...𝑁) ∈ Fin → (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) ∈ V)
93 nfcv 2386 . . . . 5 𝑓(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))
94 nfv 1577 . . . . . 6 𝑓(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
95 nfv 1577 . . . . . 6 𝑓𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥
96 nfcsb1v 3173 . . . . . . . . 9 𝑓(𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃
9746, 47, 96nfseq 10826 . . . . . . . 8 𝑓seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)
9897, 50nffv 5682 . . . . . . 7 𝑓(seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁)
9998nfeq1 2396 . . . . . 6 𝑓(seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
10094, 95, 99nf3an 1615 . . . . 5 𝑓((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
101 f1oeq1 5604 . . . . . 6 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
102 fveq1 5671 . . . . . . . 8 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → (𝑓𝑥) = ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥))
103102eqeq1d 2243 . . . . . . 7 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → ((𝑓𝑥) = 𝑥 ↔ ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥))
104103ralbidv 2544 . . . . . 6 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → (∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥))
105 csbeq1a 3149 . . . . . . . . 9 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → 𝑃 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)
106105seqeq3d 10824 . . . . . . . 8 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → seq𝑀( + , 𝑃) = seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃))
107106fveq1d 5674 . . . . . . 7 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁))
108107eqeq1d 2243 . . . . . 6 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
109101, 104, 1083anbi123d 1349 . . . . 5 (𝑓 = (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
11093, 100, 109spcegf 2902 . . . 4 ((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) ∈ V → (((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
11191, 92, 1103syl 17 . . 3 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → (((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))):(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)((𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢)))‘𝑥) = 𝑥 ∧ (seq𝑀( + , (𝑢 ∈ (𝑀...𝑁) ↦ if(𝑢 ∈ (𝐾...(𝐽𝐾)), if(𝑢 = 𝐾, 𝐾, (𝐽‘(𝑢 − 1))), (𝐽𝑢))) / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
11268, 70, 88, 111mp3and 1377 . 2 ((𝜑 ∧ ¬ 𝐾 = (𝐽𝐾)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
113 f1ocnv 5629 . . . . . . 7 (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
114 f1of 5616 . . . . . . 7 (𝐽:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
1151, 113, 1143syl 17 . . . . . 6 (𝜑𝐽:(𝑀...𝑁)⟶(𝑀...𝑁))
116115, 4ffvelcdmd 5815 . . . . 5 (𝜑 → (𝐽𝐾) ∈ (𝑀...𝑁))
117 elfzelz 10365 . . . . 5 ((𝐽𝐾) ∈ (𝑀...𝑁) → (𝐽𝐾) ∈ ℤ)
118116, 117syl 14 . . . 4 (𝜑 → (𝐽𝐾) ∈ ℤ)
119 zdceq 9658 . . . 4 ((𝐾 ∈ ℤ ∧ (𝐽𝐾) ∈ ℤ) → DECID 𝐾 = (𝐽𝐾))
12024, 118, 119syl2anc 411 . . 3 (𝜑DECID 𝐾 = (𝐽𝐾))
121 exmiddc 844 . . 3 (DECID 𝐾 = (𝐽𝐾) → (𝐾 = (𝐽𝐾) ∨ ¬ 𝐾 = (𝐽𝐾)))
122120, 121syl 14 . 2 (𝜑 → (𝐾 = (𝐽𝐾) ∨ ¬ 𝐾 = (𝐽𝐾)))
12364, 112, 122mpjaodan 806 1 (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝐾)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 716  DECID wdc 842  w3a 1005   = wceq 1398  wex 1541  wcel 2205  wne 2414  wral 2522  Vcvv 2815  csb 3140  cun 3211  ifcif 3622  {csn 3691   class class class wbr 4111  cmpt 4173  ccnv 4750  wf 5350  1-1-ontowf1o 5353  cfv 5354  (class class class)co 6052  Fincfn 6977  1c1 8133  cle 8314  cmin 8449  cz 9582  cuz 9859  ...cfz 10348  ..^cfzo 10483  seqcseq 10816
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4227  ax-sep 4230  ax-nul 4238  ax-pow 4289  ax-pr 4324  ax-un 4556  ax-setind 4661  ax-iinf 4712  ax-cnex 8223  ax-resscn 8224  ax-1cn 8225  ax-1re 8226  ax-icn 8227  ax-addcl 8228  ax-addrcl 8229  ax-mulcl 8230  ax-addcom 8232  ax-addass 8234  ax-distr 8236  ax-i2m1 8237  ax-0lt1 8238  ax-0id 8240  ax-rnegex 8241  ax-cnre 8243  ax-pre-ltirr 8244  ax-pre-ltwlin 8245  ax-pre-lttrn 8246  ax-pre-apti 8247  ax-pre-ltadd 8248
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3045  df-csb 3141  df-dif 3215  df-un 3217  df-in 3219  df-ss 3226  df-nul 3511  df-if 3623  df-pw 3673  df-sn 3697  df-pr 3698  df-op 3700  df-uni 3917  df-int 3952  df-iun 3995  df-br 4112  df-opab 4174  df-mpt 4175  df-tr 4211  df-id 4416  df-iord 4489  df-on 4491  df-ilim 4492  df-suc 4494  df-iom 4715  df-xp 4757  df-rel 4758  df-cnv 4759  df-co 4760  df-dm 4761  df-rn 4762  df-res 4763  df-ima 4764  df-iota 5314  df-fun 5356  df-fn 5357  df-f 5358  df-f1 5359  df-fo 5360  df-f1o 5361  df-fv 5362  df-riota 6005  df-ov 6055  df-oprab 6056  df-mpo 6057  df-1st 6336  df-2nd 6337  df-recs 6538  df-frec 6624  df-1o 6649  df-er 6769  df-en 6978  df-fin 6980  df-pnf 8315  df-mnf 8316  df-xr 8317  df-ltxr 8318  df-le 8319  df-sub 8451  df-neg 8452  df-inn 9243  df-n0 9502  df-z 9583  df-uz 9860  df-fz 10349  df-fzo 10484  df-seqfrec 10817
This theorem is referenced by:  seq3f1olemp  10884
  Copyright terms: Public domain W3C validator