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

Theorem seq3f1olemp 10520
Description: Lemma for seq3f1o 10522. 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 10050 . . 3 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ (𝑀...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ (𝑀...𝑁))
4 oveq2 5899 . . . . . . 7 (𝑤 = 𝑀 → (𝑀...𝑤) = (𝑀...𝑀))
54raleqdv 2692 . . . . . 6 (𝑤 = 𝑀 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥))
653anbi2d 1328 . . . . 5 (𝑤 = 𝑀 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
76exbidv 1836 . . . 4 (𝑤 = 𝑀 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
87imbi2d 230 . . 3 (𝑤 = 𝑀 → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
9 oveq2 5899 . . . . . . 7 (𝑤 = 𝑘 → (𝑀...𝑤) = (𝑀...𝑘))
109raleqdv 2692 . . . . . 6 (𝑤 = 𝑘 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥))
11103anbi2d 1328 . . . . 5 (𝑤 = 𝑘 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1211exbidv 1836 . . . 4 (𝑤 = 𝑘 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1312imbi2d 230 . . 3 (𝑤 = 𝑘 → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
14 oveq2 5899 . . . . . . 7 (𝑤 = (𝑘 + 1) → (𝑀...𝑤) = (𝑀...(𝑘 + 1)))
1514raleqdv 2692 . . . . . 6 (𝑤 = (𝑘 + 1) → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥))
16153anbi2d 1328 . . . . 5 (𝑤 = (𝑘 + 1) → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1716exbidv 1836 . . . 4 (𝑤 = (𝑘 + 1) → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1817imbi2d 230 . . 3 (𝑤 = (𝑘 + 1) → ((𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ↔ (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))))
19 oveq2 5899 . . . . . . 7 (𝑤 = 𝑁 → (𝑀...𝑤) = (𝑀...𝑁))
2019raleqdv 2692 . . . . . 6 (𝑤 = 𝑁 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥))
21203anbi2d 1328 . . . . 5 (𝑤 = 𝑁 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
2221exbidv 1836 . . . 4 (𝑤 = 𝑁 → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
2322imbi2d 230 . . 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 10049 . . . . . 6 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
301, 29syl 14 . . . . 5 (𝜑𝑀 ∈ (𝑀...𝑁))
31 ral0 3539 . . . . . . 7 𝑥 ∈ ∅ (𝐹𝑥) = 𝑥
32 fzo0 10186 . . . . . . . 8 (𝑀..^𝑀) = ∅
3332raleqi 2690 . . . . . . 7 (∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥 ↔ ∀𝑥 ∈ ∅ (𝐹𝑥) = 𝑥)
3431, 33mpbir 146 . . . . . 6 𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥
3534a1i 9 . . . . 5 (𝜑 → ∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥)
36 f1of 5476 . . . . . . . . . 10 (𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
3727, 36syl 14 . . . . . . . . 9 (𝜑𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
38 eluzel2 9551 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
391, 38syl 14 . . . . . . . . . 10 (𝜑𝑀 ∈ ℤ)
40 eluzelz 9555 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ ℤ)
411, 40syl 14 . . . . . . . . . 10 (𝜑𝑁 ∈ ℤ)
4239, 41fzfigd 10449 . . . . . . . . 9 (𝜑 → (𝑀...𝑁) ∈ Fin)
43 fex 5761 . . . . . . . . 9 ((𝐹:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → 𝐹 ∈ V)
4437, 42, 43syl2anc 411 . . . . . . . 8 (𝜑𝐹 ∈ V)
45 fveq1 5529 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
4645fveq2d 5534 . . . . . . . . . . . 12 (𝑓 = 𝐹 → (𝐺‘(𝑓𝑥)) = (𝐺‘(𝐹𝑥)))
4746ifeq1d 3566 . . . . . . . . . . 11 (𝑓 = 𝐹 → if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)) = if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
4847mpteq2dv 4109 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀))) = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀))))
49 iseqf1o.p . . . . . . . . . 10 𝑃 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)))
50 iseqf1o.l . . . . . . . . . 10 𝐿 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
5148, 49, 503eqtr4g 2247 . . . . . . . . 9 (𝑓 = 𝐹𝑃 = 𝐿)
5251adantl 277 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑃 = 𝐿)
5344, 52csbied 3118 . . . . . . 7 (𝜑𝐹 / 𝑓𝑃 = 𝐿)
5453seqeq3d 10471 . . . . . 6 (𝜑 → seq𝑀( + , 𝐹 / 𝑓𝑃) = seq𝑀( + , 𝐿))
5554fveq1d 5532 . . . . 5 (𝜑 → (seq𝑀( + , 𝐹 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
5624, 25, 26, 1, 27, 28, 30, 27, 35, 55, 49seq3f1olemstep 10519 . . . 4 (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
5756a1i 9 . . 3 (𝑁 ∈ (ℤ𝑀) → (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
58 nfv 1539 . . . . . . . 8 𝑔(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
59 nfv 1539 . . . . . . . . 9 𝑓 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
60 nfv 1539 . . . . . . . . 9 𝑓𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥
61 nfcv 2332 . . . . . . . . . . . 12 𝑓𝑀
62 nfcv 2332 . . . . . . . . . . . 12 𝑓 +
63 nfcsb1v 3105 . . . . . . . . . . . 12 𝑓𝑔 / 𝑓𝑃
6461, 62, 63nfseq 10473 . . . . . . . . . . 11 𝑓seq𝑀( + , 𝑔 / 𝑓𝑃)
65 nfcv 2332 . . . . . . . . . . 11 𝑓𝑁
6664, 65nffv 5540 . . . . . . . . . 10 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁)
6766nfeq1 2342 . . . . . . . . 9 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
6859, 60, 67nf3an 1577 . . . . . . . 8 𝑓(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
69 f1oeq1 5464 . . . . . . . . 9 (𝑓 = 𝑔 → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
70 fveq1 5529 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑓𝑥) = (𝑔𝑥))
7170eqeq1d 2198 . . . . . . . . . 10 (𝑓 = 𝑔 → ((𝑓𝑥) = 𝑥 ↔ (𝑔𝑥) = 𝑥))
7271ralbidv 2490 . . . . . . . . 9 (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥))
73 csbeq1a 3081 . . . . . . . . . . . 12 (𝑓 = 𝑔𝑃 = 𝑔 / 𝑓𝑃)
7473seqeq3d 10471 . . . . . . . . . . 11 (𝑓 = 𝑔 → seq𝑀( + , 𝑃) = seq𝑀( + , 𝑔 / 𝑓𝑃))
7574fveq1d 5532 . . . . . . . . . 10 (𝑓 = 𝑔 → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁))
7675eqeq1d 2198 . . . . . . . . 9 (𝑓 = 𝑔 → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
7769, 72, 763anbi123d 1323 . . . . . . . 8 (𝑓 = 𝑔 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
7858, 68, 77cbvex 1767 . . . . . . 7 (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
79 fveq2 5530 . . . . . . . . . . 11 (𝑥 = 𝑎 → (𝑔𝑥) = (𝑔𝑎))
80 id 19 . . . . . . . . . . 11 (𝑥 = 𝑎𝑥 = 𝑎)
8179, 80eqeq12d 2204 . . . . . . . . . 10 (𝑥 = 𝑎 → ((𝑔𝑥) = 𝑥 ↔ (𝑔𝑎) = 𝑎))
8281cbvralv 2718 . . . . . . . . 9 (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
83823anbi2i 1193 . . . . . . . 8 ((𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
8483exbii 1616 . . . . . . 7 (∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
8578, 84bitri 184 . . . . . 6 (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
86 simpll 527 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝜑)
8786, 24sylan 283 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
8886, 25sylan 283 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆)) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
8986, 26sylan 283 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ (𝑥𝑆𝑦𝑆𝑧𝑆)) → ((𝑥 + 𝑦) + 𝑧) = (𝑥 + (𝑦 + 𝑧)))
901ad2antrr 488 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑁 ∈ (ℤ𝑀))
9127ad2antrr 488 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
9286, 28sylan 283 . . . . . . . . 9 ((((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) ∧ 𝑥 ∈ (ℤ𝑀)) → (𝐺𝑥) ∈ 𝑆)
93 fzofzp1 10245 . . . . . . . . . 10 (𝑘 ∈ (𝑀..^𝑁) → (𝑘 + 1) ∈ (𝑀...𝑁))
9493ad2antlr 489 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (𝑘 + 1) ∈ (𝑀...𝑁))
95 simpr1 1005 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
96 simpr2 1006 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
9796, 82sylibr 134 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥)
98 elfzoelz 10165 . . . . . . . . . . . 12 (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ ℤ)
9998ad2antlr 489 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑘 ∈ ℤ)
100 fzval3 10222 . . . . . . . . . . . 12 (𝑘 ∈ ℤ → (𝑀...𝑘) = (𝑀..^(𝑘 + 1)))
101100raleqdv 2692 . . . . . . . . . . 11 (𝑘 ∈ ℤ → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10299, 101syl 14 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10397, 102mpbid 147 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥)
104 simpr3 1007 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
10587, 88, 89, 90, 91, 92, 94, 95, 103, 104, 49seq3f1olemstep 10519 . . . . . . . 8 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
106105ex 115 . . . . . . 7 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → ((𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
107106exlimdv 1830 . . . . . 6 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → (∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
10885, 107biimtrid 152 . . . . 5 ((𝜑𝑘 ∈ (𝑀..^𝑁)) → (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
109108expcom 116 . . . 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 10257 . 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 104  wb 105  w3a 980   = wceq 1364  wex 1503  wcel 2160  wral 2468  Vcvv 2752  csb 3072  c0 3437  ifcif 3549   class class class wbr 4018  cmpt 4079  wf 5227  1-1-ontowf1o 5230  cfv 5231  (class class class)co 5891  Fincfn 6758  1c1 7830   + caddc 7832  cle 8011  cz 9271  cuz 9546  ...cfz 10026  ..^cfzo 10160  seqcseq 10463
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 2162  ax-14 2163  ax-ext 2171  ax-coll 4133  ax-sep 4136  ax-nul 4144  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-setind 4551  ax-iinf 4602  ax-cnex 7920  ax-resscn 7921  ax-1cn 7922  ax-1re 7923  ax-icn 7924  ax-addcl 7925  ax-addrcl 7926  ax-mulcl 7927  ax-addcom 7929  ax-addass 7931  ax-distr 7933  ax-i2m1 7934  ax-0lt1 7935  ax-0id 7937  ax-rnegex 7938  ax-cnre 7940  ax-pre-ltirr 7941  ax-pre-ltwlin 7942  ax-pre-lttrn 7943  ax-pre-apti 7944  ax-pre-ltadd 7945
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 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ne 2361  df-nel 2456  df-ral 2473  df-rex 2474  df-reu 2475  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-dif 3146  df-un 3148  df-in 3150  df-ss 3157  df-nul 3438  df-if 3550  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-iun 3903  df-br 4019  df-opab 4080  df-mpt 4081  df-tr 4117  df-id 4308  df-iord 4381  df-on 4383  df-ilim 4384  df-suc 4386  df-iom 4605  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-ima 4654  df-iota 5193  df-fun 5233  df-fn 5234  df-f 5235  df-f1 5236  df-fo 5237  df-f1o 5238  df-fv 5239  df-riota 5847  df-ov 5894  df-oprab 5895  df-mpo 5896  df-1st 6159  df-2nd 6160  df-recs 6324  df-frec 6410  df-1o 6435  df-er 6553  df-en 6759  df-fin 6761  df-pnf 8012  df-mnf 8013  df-xr 8014  df-ltxr 8015  df-le 8016  df-sub 8148  df-neg 8149  df-inn 8938  df-n0 9195  df-z 9272  df-uz 9547  df-fz 10027  df-fzo 10161  df-seqfrec 10464
This theorem is referenced by:  seq3f1oleml  10521
  Copyright terms: Public domain W3C validator