MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ulm2 Structured version   Visualization version   GIF version

Theorem ulm2 26443
Description: Simplify ulmval 26438 when 𝐹 and 𝐺 are known to be functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
Hypotheses
Ref Expression
ulm2.z 𝑍 = (ℤ𝑀)
ulm2.m (𝜑𝑀 ∈ ℤ)
ulm2.f (𝜑𝐹:𝑍⟶(ℂ ↑m 𝑆))
ulm2.b ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)
ulm2.a ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)
ulm2.g (𝜑𝐺:𝑆⟶ℂ)
ulm2.s (𝜑𝑆𝑉)
Assertion
Ref Expression
ulm2 (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
Distinct variable groups:   𝑗,𝑘,𝑥,𝑧,𝐹   𝑗,𝐺,𝑘,𝑥,𝑧   𝑗,𝑀,𝑘,𝑥,𝑧   𝜑,𝑗,𝑘,𝑥,𝑧   𝐴,𝑗,𝑘,𝑥   𝑥,𝐵   𝑆,𝑗,𝑘,𝑥,𝑧   𝑗,𝑍,𝑥
Allowed substitution hints:   𝐴(𝑧)   𝐵(𝑧,𝑗,𝑘)   𝑉(𝑥,𝑧,𝑗,𝑘)   𝑍(𝑧,𝑘)

Proof of Theorem ulm2
Dummy variable 𝑛 is distinct from all other variables.
StepHypRef Expression
1 ulm2.s . . 3 (𝜑𝑆𝑉)
2 ulmval 26438 . . 3 (𝑆𝑉 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
31, 2syl 17 . 2 (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
4 3anan12 1095 . . . 4 ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
5 ulm2.z . . . . . . . . . 10 𝑍 = (ℤ𝑀)
6 ulm2.f . . . . . . . . . . . 12 (𝜑𝐹:𝑍⟶(ℂ ↑m 𝑆))
76fdmd 6747 . . . . . . . . . . 11 (𝜑 → dom 𝐹 = 𝑍)
8 fdm 6746 . . . . . . . . . . 11 (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) → dom 𝐹 = (ℤ𝑛))
97, 8sylan9req 2796 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑍 = (ℤ𝑛))
105, 9eqtr3id 2789 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → (ℤ𝑀) = (ℤ𝑛))
11 ulm2.m . . . . . . . . . . 11 (𝜑𝑀 ∈ ℤ)
1211adantr 480 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 ∈ ℤ)
13 uz11 12901 . . . . . . . . . 10 (𝑀 ∈ ℤ → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1412, 13syl 17 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1510, 14mpbid 232 . . . . . . . 8 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 = 𝑛)
1615eqcomd 2741 . . . . . . 7 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑛 = 𝑀)
17 fveq2 6907 . . . . . . . . . . 11 (𝑛 = 𝑀 → (ℤ𝑛) = (ℤ𝑀))
1817, 5eqtr4di 2793 . . . . . . . . . 10 (𝑛 = 𝑀 → (ℤ𝑛) = 𝑍)
1918feq2d 6723 . . . . . . . . 9 (𝑛 = 𝑀 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝐹:𝑍⟶(ℂ ↑m 𝑆)))
2019biimparc 479 . . . . . . . 8 ((𝐹:𝑍⟶(ℂ ↑m 𝑆) ∧ 𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
216, 20sylan 580 . . . . . . 7 ((𝜑𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
2216, 21impbida 801 . . . . . 6 (𝜑 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝑛 = 𝑀))
2322anbi1d 631 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
24 ulm2.g . . . . . 6 (𝜑𝐺:𝑆⟶ℂ)
2524biantrurd 532 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥))))
26 simp-4l 783 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝜑)
27 simpr 484 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑛 = 𝑀)
28 uzid 12891 . . . . . . . . . . . . . . . . . . . . 21 (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ𝑀))
2911, 28syl 17 . . . . . . . . . . . . . . . . . . . 20 (𝜑𝑀 ∈ (ℤ𝑀))
3029, 5eleqtrrdi 2850 . . . . . . . . . . . . . . . . . . 19 (𝜑𝑀𝑍)
3130adantr 480 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑀𝑍)
3227, 31eqeltrd 2839 . . . . . . . . . . . . . . . . 17 ((𝜑𝑛 = 𝑀) → 𝑛𝑍)
335uztrn2 12895 . . . . . . . . . . . . . . . . 17 ((𝑛𝑍𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
3432, 33sylan 580 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
355uztrn2 12895 . . . . . . . . . . . . . . . 16 ((𝑗𝑍𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3634, 35sylan 580 . . . . . . . . . . . . . . 15 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3736adantr 480 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑘𝑍)
38 simpr 484 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑧𝑆)
39 ulm2.b . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)
4026, 37, 38, 39syl12anc 837 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((𝐹𝑘)‘𝑧) = 𝐵)
41 ulm2.a . . . . . . . . . . . . . 14 ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)
4226, 41sylancom 588 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (𝐺𝑧) = 𝐴)
4340, 42oveq12d 7449 . . . . . . . . . . . 12 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (((𝐹𝑘)‘𝑧) − (𝐺𝑧)) = (𝐵𝐴))
4443fveq2d 6911 . . . . . . . . . . 11 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) = (abs‘(𝐵𝐴)))
4544breq1d 5158 . . . . . . . . . 10 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ (abs‘(𝐵𝐴)) < 𝑥))
4645ralbidva 3174 . . . . . . . . 9 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → (∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4746ralbidva 3174 . . . . . . . 8 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → (∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4847rexbidva 3175 . . . . . . 7 ((𝜑𝑛 = 𝑀) → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4948ralbidv 3176 . . . . . 6 ((𝜑𝑛 = 𝑀) → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5049pm5.32da 579 . . . . 5 (𝜑 → ((𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5123, 25, 503bitr3d 309 . . . 4 (𝜑 → ((𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
524, 51bitrid 283 . . 3 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5352rexbidv 3177 . 2 (𝜑 → (∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5418rexeqdv 3325 . . . . 5 (𝑛 = 𝑀 → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5554ralbidv 3176 . . . 4 (𝑛 = 𝑀 → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5655ceqsrexv 3655 . . 3 (𝑀 ∈ ℤ → (∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5711, 56syl 17 . 2 (𝜑 → (∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
583, 53, 573bitrd 305 1 (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  wrex 3068   class class class wbr 5148  dom cdm 5689  wf 6559  cfv 6563  (class class class)co 7431  m cmap 8865  cc 11151   < clt 11293  cmin 11490  cz 12611  cuz 12876  +crp 13032  abscabs 15270  𝑢culm 26434
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-cnex 11209  ax-resscn 11210  ax-pre-lttri 11227  ax-pre-lttrn 11228
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-nel 3045  df-ral 3060  df-rex 3069  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-po 5597  df-so 5598  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-ov 7434  df-oprab 7435  df-mpo 7436  df-er 8744  df-map 8867  df-pm 8868  df-en 8985  df-dom 8986  df-sdom 8987  df-pnf 11295  df-mnf 11296  df-xr 11297  df-ltxr 11298  df-le 11299  df-neg 11493  df-z 12612  df-uz 12877  df-ulm 26435
This theorem is referenced by:  ulmi  26444  ulmclm  26445  ulmres  26446  ulmshftlem  26447  ulm0  26449  ulmcau  26453  ulmss  26455
  Copyright terms: Public domain W3C validator