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

Theorem seq3f1olemp 10488
Description: Lemma for seq3f1o 10490. 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 10018 . . 3 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ (𝑀...𝑁))
31, 2syl 14 . 2 (𝜑𝑁 ∈ (𝑀...𝑁))
4 oveq2 5877 . . . . . . 7 (𝑤 = 𝑀 → (𝑀...𝑤) = (𝑀...𝑀))
54raleqdv 2678 . . . . . 6 (𝑤 = 𝑀 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥))
653anbi2d 1317 . . . . 5 (𝑤 = 𝑀 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
76exbidv 1825 . . . 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 5877 . . . . . . 7 (𝑤 = 𝑘 → (𝑀...𝑤) = (𝑀...𝑘))
109raleqdv 2678 . . . . . 6 (𝑤 = 𝑘 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥))
11103anbi2d 1317 . . . . 5 (𝑤 = 𝑘 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1211exbidv 1825 . . . 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 5877 . . . . . . 7 (𝑤 = (𝑘 + 1) → (𝑀...𝑤) = (𝑀...(𝑘 + 1)))
1514raleqdv 2678 . . . . . 6 (𝑤 = (𝑘 + 1) → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥))
16153anbi2d 1317 . . . . 5 (𝑤 = (𝑘 + 1) → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...(𝑘 + 1))(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
1716exbidv 1825 . . . 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 5877 . . . . . . 7 (𝑤 = 𝑁 → (𝑀...𝑤) = (𝑀...𝑁))
2019raleqdv 2678 . . . . . 6 (𝑤 = 𝑁 → (∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥))
21203anbi2d 1317 . . . . 5 (𝑤 = 𝑁 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑤)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑁)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
2221exbidv 1825 . . . 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 10017 . . . . . 6 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ (𝑀...𝑁))
301, 29syl 14 . . . . 5 (𝜑𝑀 ∈ (𝑀...𝑁))
31 ral0 3524 . . . . . . 7 𝑥 ∈ ∅ (𝐹𝑥) = 𝑥
32 fzo0 10154 . . . . . . . 8 (𝑀..^𝑀) = ∅
3332raleqi 2676 . . . . . . 7 (∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥 ↔ ∀𝑥 ∈ ∅ (𝐹𝑥) = 𝑥)
3431, 33mpbir 146 . . . . . 6 𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥
3534a1i 9 . . . . 5 (𝜑 → ∀𝑥 ∈ (𝑀..^𝑀)(𝐹𝑥) = 𝑥)
36 f1of 5457 . . . . . . . . . 10 (𝐹:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) → 𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
3727, 36syl 14 . . . . . . . . 9 (𝜑𝐹:(𝑀...𝑁)⟶(𝑀...𝑁))
38 eluzel2 9522 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑀 ∈ ℤ)
391, 38syl 14 . . . . . . . . . 10 (𝜑𝑀 ∈ ℤ)
40 eluzelz 9526 . . . . . . . . . . 11 (𝑁 ∈ (ℤ𝑀) → 𝑁 ∈ ℤ)
411, 40syl 14 . . . . . . . . . 10 (𝜑𝑁 ∈ ℤ)
4239, 41fzfigd 10417 . . . . . . . . 9 (𝜑 → (𝑀...𝑁) ∈ Fin)
43 fex 5741 . . . . . . . . 9 ((𝐹:(𝑀...𝑁)⟶(𝑀...𝑁) ∧ (𝑀...𝑁) ∈ Fin) → 𝐹 ∈ V)
4437, 42, 43syl2anc 411 . . . . . . . 8 (𝜑𝐹 ∈ V)
45 fveq1 5510 . . . . . . . . . . . . 13 (𝑓 = 𝐹 → (𝑓𝑥) = (𝐹𝑥))
4645fveq2d 5515 . . . . . . . . . . . 12 (𝑓 = 𝐹 → (𝐺‘(𝑓𝑥)) = (𝐺‘(𝐹𝑥)))
4746ifeq1d 3551 . . . . . . . . . . 11 (𝑓 = 𝐹 → if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)) = if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
4847mpteq2dv 4091 . . . . . . . . . 10 (𝑓 = 𝐹 → (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀))) = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀))))
49 iseqf1o.p . . . . . . . . . 10 𝑃 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝑓𝑥)), (𝐺𝑀)))
50 iseqf1o.l . . . . . . . . . 10 𝐿 = (𝑥 ∈ (ℤ𝑀) ↦ if(𝑥𝑁, (𝐺‘(𝐹𝑥)), (𝐺𝑀)))
5148, 49, 503eqtr4g 2235 . . . . . . . . 9 (𝑓 = 𝐹𝑃 = 𝐿)
5251adantl 277 . . . . . . . 8 ((𝜑𝑓 = 𝐹) → 𝑃 = 𝐿)
5344, 52csbied 3103 . . . . . . 7 (𝜑𝐹 / 𝑓𝑃 = 𝐿)
5453seqeq3d 10439 . . . . . 6 (𝜑 → seq𝑀( + , 𝐹 / 𝑓𝑃) = seq𝑀( + , 𝐿))
5554fveq1d 5513 . . . . 5 (𝜑 → (seq𝑀( + , 𝐹 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
5624, 25, 26, 1, 27, 28, 30, 27, 35, 55, 49seq3f1olemstep 10487 . . . 4 (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
5756a1i 9 . . 3 (𝑁 ∈ (ℤ𝑀) → (𝜑 → ∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑀)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
58 nfv 1528 . . . . . . . 8 𝑔(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
59 nfv 1528 . . . . . . . . 9 𝑓 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)
60 nfv 1528 . . . . . . . . 9 𝑓𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥
61 nfcv 2319 . . . . . . . . . . . 12 𝑓𝑀
62 nfcv 2319 . . . . . . . . . . . 12 𝑓 +
63 nfcsb1v 3090 . . . . . . . . . . . 12 𝑓𝑔 / 𝑓𝑃
6461, 62, 63nfseq 10441 . . . . . . . . . . 11 𝑓seq𝑀( + , 𝑔 / 𝑓𝑃)
65 nfcv 2319 . . . . . . . . . . 11 𝑓𝑁
6664, 65nffv 5521 . . . . . . . . . 10 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁)
6766nfeq1 2329 . . . . . . . . 9 𝑓(seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)
6859, 60, 67nf3an 1566 . . . . . . . 8 𝑓(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
69 f1oeq1 5445 . . . . . . . . 9 (𝑓 = 𝑔 → (𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ↔ 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁)))
70 fveq1 5510 . . . . . . . . . . 11 (𝑓 = 𝑔 → (𝑓𝑥) = (𝑔𝑥))
7170eqeq1d 2186 . . . . . . . . . 10 (𝑓 = 𝑔 → ((𝑓𝑥) = 𝑥 ↔ (𝑔𝑥) = 𝑥))
7271ralbidv 2477 . . . . . . . . 9 (𝑓 = 𝑔 → (∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥))
73 csbeq1a 3066 . . . . . . . . . . . 12 (𝑓 = 𝑔𝑃 = 𝑔 / 𝑓𝑃)
7473seqeq3d 10439 . . . . . . . . . . 11 (𝑓 = 𝑔 → seq𝑀( + , 𝑃) = seq𝑀( + , 𝑔 / 𝑓𝑃))
7574fveq1d 5513 . . . . . . . . . 10 (𝑓 = 𝑔 → (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁))
7675eqeq1d 2186 . . . . . . . . 9 (𝑓 = 𝑔 → ((seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁) ↔ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
7769, 72, 763anbi123d 1312 . . . . . . . 8 (𝑓 = 𝑔 → ((𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))))
7858, 68, 77cbvex 1756 . . . . . . 7 (∃𝑓(𝑓:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑓𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ ∃𝑔(𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
79 fveq2 5511 . . . . . . . . . . 11 (𝑥 = 𝑎 → (𝑔𝑥) = (𝑔𝑎))
80 id 19 . . . . . . . . . . 11 (𝑥 = 𝑎𝑥 = 𝑎)
8179, 80eqeq12d 2192 . . . . . . . . . 10 (𝑥 = 𝑎 → ((𝑔𝑥) = 𝑥 ↔ (𝑔𝑎) = 𝑎))
8281cbvralv 2703 . . . . . . . . 9 (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
83823anbi2i 1191 . . . . . . . 8 ((𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)) ↔ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁)))
8483exbii 1605 . . . . . . 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 10213 . . . . . . . . . 10 (𝑘 ∈ (𝑀..^𝑁) → (𝑘 + 1) ∈ (𝑀...𝑁))
9493ad2antlr 489 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (𝑘 + 1) ∈ (𝑀...𝑁))
95 simpr1 1003 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁))
96 simpr2 1004 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎)
9796, 82sylibr 134 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥)
98 elfzoelz 10133 . . . . . . . . . . . 12 (𝑘 ∈ (𝑀..^𝑁) → 𝑘 ∈ ℤ)
9998ad2antlr 489 . . . . . . . . . . 11 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → 𝑘 ∈ ℤ)
100 fzval3 10190 . . . . . . . . . . . 12 (𝑘 ∈ ℤ → (𝑀...𝑘) = (𝑀..^(𝑘 + 1)))
101100raleqdv 2678 . . . . . . . . . . 11 (𝑘 ∈ ℤ → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10299, 101syl 14 . . . . . . . . . 10 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (∀𝑥 ∈ (𝑀...𝑘)(𝑔𝑥) = 𝑥 ↔ ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥))
10397, 102mpbid 147 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → ∀𝑥 ∈ (𝑀..^(𝑘 + 1))(𝑔𝑥) = 𝑥)
104 simpr3 1005 . . . . . . . . 9 (((𝜑𝑘 ∈ (𝑀..^𝑁)) ∧ (𝑔:(𝑀...𝑁)–1-1-onto→(𝑀...𝑁) ∧ ∀𝑎 ∈ (𝑀...𝑘)(𝑔𝑎) = 𝑎 ∧ (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))) → (seq𝑀( + , 𝑔 / 𝑓𝑃)‘𝑁) = (seq𝑀( + , 𝐿)‘𝑁))
10587, 88, 89, 90, 91, 92, 94, 95, 103, 104, 49seq3f1olemstep 10487 . . . . . . . 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 1819 . . . . . 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 10225 . 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 978   = wceq 1353  wex 1492  wcel 2148  wral 2455  Vcvv 2737  csb 3057  c0 3422  ifcif 3534   class class class wbr 4000  cmpt 4061  wf 5208  1-1-ontowf1o 5211  cfv 5212  (class class class)co 5869  Fincfn 6734  1c1 7803   + caddc 7805  cle 7983  cz 9242  cuz 9517  ...cfz 9995  ..^cfzo 10128  seqcseq 10431
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584  ax-cnex 7893  ax-resscn 7894  ax-1cn 7895  ax-1re 7896  ax-icn 7897  ax-addcl 7898  ax-addrcl 7899  ax-mulcl 7900  ax-addcom 7902  ax-addass 7904  ax-distr 7906  ax-i2m1 7907  ax-0lt1 7908  ax-0id 7910  ax-rnegex 7911  ax-cnre 7913  ax-pre-ltirr 7914  ax-pre-ltwlin 7915  ax-pre-lttrn 7916  ax-pre-apti 7917  ax-pre-ltadd 7918
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-if 3535  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-id 4290  df-iord 4363  df-on 4365  df-ilim 4366  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-riota 5825  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-frec 6386  df-1o 6411  df-er 6529  df-en 6735  df-fin 6737  df-pnf 7984  df-mnf 7985  df-xr 7986  df-ltxr 7987  df-le 7988  df-sub 8120  df-neg 8121  df-inn 8909  df-n0 9166  df-z 9243  df-uz 9518  df-fz 9996  df-fzo 10129  df-seqfrec 10432
This theorem is referenced by:  seq3f1oleml  10489
  Copyright terms: Public domain W3C validator