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

Theorem seq3f1olemp 10268
 Description: Lemma for seq3f1o 10270. Existence of a constant permutation of (𝑀...𝑁) which leads to the same sum as the permutation 𝐹 itself. (Contributed by Jim Kingdon, 18-Aug-2022.)
Hypotheses
Ref Expression
iseqf1o.1 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
iseqf1o.2 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
iseqf1o.3 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
iseqf1o.4 (𝜑𝑁 ∈ (ℤ𝑀))
iseqf1o.6 (𝜑𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
iseqf1o.7 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
iseqf1o.l 𝐿 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
iseqf1o.p 𝑃 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)))
Assertion
Ref Expression
seq3f1olemp (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
Distinct variable groups:   + ,𝑓,𝑥,𝑦,𝑧   𝑓,𝐹,𝑥,𝑦,𝑧   𝑓,𝐿,𝑥,𝑦,𝑧   𝑓,𝑀,𝑥,𝑦,𝑧   𝑓,𝑁,𝑥,𝑦,𝑧   𝑥,𝑃,𝑦,𝑧   𝑆,𝑓,𝑥,𝑦,𝑧   𝜑,𝑓,𝑥,𝑦,𝑧   𝑓,𝐺,𝑥
Allowed substitution hints:   𝑃(𝑓)   𝐺(𝑦,𝑧)

Proof of Theorem seq3f1olemp
Dummy variables 𝑔 𝑘 𝑤 𝑎 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 iseqf1o.4 . . 3 (𝜑𝑁 ∈ (ℤ𝑀))
2 eluzfz2 9805 . . 3 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ (𝑀...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ (𝑀...𝑁))
4 oveq2 5775 . . . . . . 7 (𝑤 = 𝑀 → (𝑀...𝑤) = (𝑀...𝑀))
54raleqdv 2630 . . . . . 6 (𝑤 = 𝑀 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥))
653anbi2d 1295 . . . . 5 (𝑤 = 𝑀 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
76exbidv 1797 . . . 4 (𝑤 = 𝑀 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
87imbi2d 229 . . 3 (𝑤 = 𝑀 → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
9 oveq2 5775 . . . . . . 7 (𝑤 = 𝑘 → (𝑀...𝑤) = (𝑀...𝑘))
109raleqdv 2630 . . . . . 6 (𝑤 = 𝑘 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥))
11103anbi2d 1295 . . . . 5 (𝑤 = 𝑘 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1211exbidv 1797 . . . 4 (𝑤 = 𝑘 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1312imbi2d 229 . . 3 (𝑤 = 𝑘 → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
14 oveq2 5775 . . . . . . 7 (𝑤 = (𝑘 + 1) → (𝑀...𝑤) = (𝑀...(𝑘 + 1)))
1514raleqdv 2630 . . . . . 6 (𝑤 = (𝑘 + 1) → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥))
16153anbi2d 1295 . . . . 5 (𝑤 = (𝑘 + 1) → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1716exbidv 1797 . . . 4 (𝑤 = (𝑘 + 1) → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1817imbi2d 229 . . 3 (𝑤 = (𝑘 + 1) → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
19 oveq2 5775 . . . . . . 7 (𝑤 = 𝑁 → (𝑀...𝑤) = (𝑀...𝑁))
2019raleqdv 2630 . . . . . 6 (𝑤 = 𝑁 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥))
21203anbi2d 1295 . . . . 5 (𝑤 = 𝑁 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
2221exbidv 1797 . . . 4 (𝑤 = 𝑁 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
2322imbi2d 229 . . 3 (𝑤 = 𝑁 → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
24 iseqf1o.1 . . . . 5 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
25 iseqf1o.2 . . . . 5 ((𝜑 ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
26 iseqf1o.3 . . . . 5 ((𝜑 ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
27 iseqf1o.6 . . . . 5 (𝜑𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
28 iseqf1o.7 . . . . 5 ((𝜑𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
29 eluzfz1 9804 . . . . . 6 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
301, 29syl 14 . . . . 5 (𝜑𝑀 ∈ (𝑀...𝑁))
31 ral0 3459 . . . . . . 7 𝑥 ∈ ∅ (𝐹𝑥) = 𝑥
32 fzo0 9938 . . . . . . . 8 (𝑀..^𝑀) = ∅
3332raleqi 2628 . . . . . . 7 (∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥 ↔ ∀𝑥 ∈ ∅ (𝐹𝑥) = 𝑥)
3431, 33mpbir 145 . . . . . 6 𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥
3534a1i 9 . . . . 5 (𝜑 → ∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥)
36 f1of 5360 . . . . . . . . . 10 (𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
3727, 36syl 14 . . . . . . . . 9 (𝜑𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
38 eluzel2 9324 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
391, 38syl 14 . . . . . . . . . 10 (𝜑𝑀 ∈ ℤ)
40 eluzelz 9328 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ ℤ)
411, 40syl 14 . . . . . . . . . 10 (𝜑𝑁 ∈ ℤ)
4239, 41fzfigd 10197 . . . . . . . . 9 (𝜑 → (𝑀...𝑁) ∈ Fin)
43 fex 5640 . . . . . . . . 9 ((𝐹:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → 𝐹 ∈ V)
4437, 42, 43syl2anc 408 . . . . . . . 8 (𝜑𝐹 ∈ V)
45 fveq1 5413 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
4645fveq2d 5418 . . . . . . . . . . . 12 (𝑓 = 𝐹 → (𝐺‘(𝑓𝑥)) = (𝐺‘(𝐹𝑥)))
4746ifeq1d 3484 . . . . . . . . . . 11 (𝑓 = 𝐹 → if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)) = if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
4847mpteq2dv 4014 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀))) = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀))))
49 iseqf1o.p . . . . . . . . . 10 𝑃 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)))
50 iseqf1o.l . . . . . . . . . 10 𝐿 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
5148, 49, 503eqtr4g 2195 . . . . . . . . 9 (𝑓 = 𝐹𝑃 = 𝐿)
5251adantl 275 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑃 = 𝐿)
5344, 52csbied 3041 . . . . . . 7 (𝜑𝐹 / 𝑓𝑃 = 𝐿)
5453seqeq3d 10219 . . . . . 6 (𝜑 → seq𝑀( + , 𝐹 / 𝑓𝑃) = seq𝑀( + , 𝐿))
5554fveq1d 5416 . . . . 5 (𝜑 → (seq𝑀( + , 𝐹 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
5624, 25, 26, 1, 27, 28, 30, 27, 35, 55, 49seq3f1olemstep 10267 . . . 4 (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
5756a1i 9 . . 3 (𝑁 ∈ (ℤ𝑀) → (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
58 nfv 1508 . . . . . . . 8 𝑔(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
59 nfv 1508 . . . . . . . . 9 𝑓 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
60 nfv 1508 . . . . . . . . 9 𝑓𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥
61 nfcv 2279 . . . . . . . . . . . 12 𝑓𝑀
62 nfcv 2279 . . . . . . . . . . . 12 𝑓 +
63 nfcsb1v 3030 . . . . . . . . . . . 12 𝑓𝑔 / 𝑓𝑃
6461, 62, 63nfseq 10221 . . . . . . . . . . 11 𝑓seq𝑀( + , 𝑔 / 𝑓𝑃)
65 nfcv 2279 . . . . . . . . . . 11 𝑓𝑁
6664, 65nffv 5424 . . . . . . . . . 10 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁)
6766nfeq1 2289 . . . . . . . . 9 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
6859, 60, 67nf3an 1545 . . . . . . . 8 𝑓(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
69 f1oeq1 5351 . . . . . . . . 9 (𝑓 = 𝑔 → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
70 fveq1 5413 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑓𝑥) = (𝑔𝑥))
7170eqeq1d 2146 . . . . . . . . . 10 (𝑓 = 𝑔 → ((𝑓𝑥) = 𝑥 ↔ (𝑔𝑥) = 𝑥))
7271ralbidv 2435 . . . . . . . . 9 (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥))
73 csbeq1a 3007 . . . . . . . . . . . 12 (𝑓 = 𝑔𝑃 = 𝑔 / 𝑓𝑃)
7473seqeq3d 10219 . . . . . . . . . . 11 (𝑓 = 𝑔 → seq𝑀( + , 𝑃) = seq𝑀( + , 𝑔 / 𝑓𝑃))
7574fveq1d 5416 . . . . . . . . . 10 (𝑓 = 𝑔 → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁))
7675eqeq1d 2146 . . . . . . . . 9 (𝑓 = 𝑔 → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
7769, 72, 763anbi123d 1290 . . . . . . . 8 (𝑓 = 𝑔 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
7858, 68, 77cbvex 1729 . . . . . . 7 (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
79 fveq2 5414 . . . . . . . . . . 11 (𝑥 = 𝑎 → (𝑔𝑥) = (𝑔𝑎))
80 id 19 . . . . . . . . . . 11 (𝑥 = 𝑎𝑥 = 𝑎)
8179, 80eqeq12d 2152 . . . . . . . . . 10 (𝑥 = 𝑎 → ((𝑔𝑥) = 𝑥 ↔ (𝑔𝑎) = 𝑎))
8281cbvralv 2652 . . . . . . . . 9 (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
83823anbi2i 1173 . . . . . . . 8 ((𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
8483exbii 1584 . . . . . . 7 (∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
8578, 84bitri 183 . . . . . 6 (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
86 simpll 518 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝜑)
8786, 24sylan 281 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
8886, 25sylan 281 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
8986, 26sylan 281 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
901ad2antrr 479 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑁 ∈ (ℤ𝑀))
9127ad2antrr 479 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
9286, 28sylan 281 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
93 fzofzp1 9997 . . . . . . . . . 10 (𝑘 ∈ (𝑀..^𝑁) → (𝑘 + 1) ∈ (𝑀...𝑁))
9493ad2antlr 480 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (𝑘 + 1) ∈ (𝑀...𝑁))
95 simpr1 987 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
96 simpr2 988 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
9796, 82sylibr 133 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥)
98 elfzoelz 9917 . . . . . . . . . . . 12 (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ ℤ)
9998ad2antlr 480 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑘 ∈ ℤ)
100 fzval3 9974 . . . . . . . . . . . 12 (𝑘 ∈ ℤ → (𝑀...𝑘) = (𝑀..^(𝑘 + 1)))
101100raleqdv 2630 . . . . . . . . . . 11 (𝑘 ∈ ℤ → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10299, 101syl 14 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10397, 102mpbid 146 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥)
104 simpr3 989 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
10587, 88, 89, 90, 91, 92, 94, 95, 103, 104, 49seq3f1olemstep 10267 . . . . . . . 8 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
106105ex 114 . . . . . . 7 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → ((𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
107106exlimdv 1791 . . . . . 6 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → (∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
10885, 107syl5bi 151 . . . . 5 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
109108expcom 115 . . . 4 (𝑘 ∈ (𝑀..^𝑁) → (𝜑 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
110109a2d 26 . . 3 (𝑘 ∈ (𝑀..^𝑁) → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
1118, 13, 18, 23, 57, 110fzind2 10009 . 2 (𝑁 ∈ (𝑀...𝑁) → (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1123, 111mpcom 36 1 (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104   ∧ w3a 962   = wceq 1331  ∃wex 1468   ∈ wcel 1480  ∀wral 2414  Vcvv 2681  ⦋csb 2998  ∅c0 3358  ifcif 3469   class class class wbr 3924   ↦ cmpt 3984  ⟶wf 5114  –1-1-onto→wf1o 5117  ‘cfv 5118  (class class class)co 5767  Fincfn 6627  1c1 7614   + caddc 7616   ≤ cle 7794  ℤcz 9047  ℤ≥cuz 9319  ...cfz 9783  ..^cfzo 9912  seqcseq 10211 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497  ax-cnex 7704  ax-resscn 7705  ax-1cn 7706  ax-1re 7707  ax-icn 7708  ax-addcl 7709  ax-addrcl 7710  ax-mulcl 7711  ax-addcom 7713  ax-addass 7715  ax-distr 7717  ax-i2m1 7718  ax-0lt1 7719  ax-0id 7721  ax-rnegex 7722  ax-cnre 7724  ax-pre-ltirr 7725  ax-pre-ltwlin 7726  ax-pre-lttrn 7727  ax-pre-apti 7728  ax-pre-ltadd 7729 This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-nel 2402  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-if 3470  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-ilim 4286  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-riota 5723  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-frec 6281  df-1o 6306  df-er 6422  df-en 6628  df-fin 6630  df-pnf 7795  df-mnf 7796  df-xr 7797  df-ltxr 7798  df-le 7799  df-sub 7928  df-neg 7929  df-inn 8714  df-n0 8971  df-z 9048  df-uz 9320  df-fz 9784  df-fzo 9913  df-seqfrec 10212 This theorem is referenced by:  seq3f1oleml  10269
 Copyright terms: Public domain W3C validator