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

Theorem ulm2 25615
Description: Simplify ulmval 25610 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 25610 . . 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 6646 . . . . . . . . . . 11 (𝜑 → dom 𝐹 = 𝑍)
8 fdm 6644 . . . . . . . . . . 11 (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) → dom 𝐹 = (ℤ𝑛))
97, 8sylan9req 2798 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑍 = (ℤ𝑛))
105, 9eqtr3id 2791 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → (ℤ𝑀) = (ℤ𝑛))
11 ulm2.m . . . . . . . . . . 11 (𝜑𝑀 ∈ ℤ)
1211adantr 481 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 ∈ ℤ)
13 uz11 12677 . . . . . . . . . 10 (𝑀 ∈ ℤ → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1412, 13syl 17 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1510, 14mpbid 231 . . . . . . . 8 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 = 𝑛)
1615eqcomd 2743 . . . . . . 7 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑛 = 𝑀)
17 fveq2 6809 . . . . . . . . . . 11 (𝑛 = 𝑀 → (ℤ𝑛) = (ℤ𝑀))
1817, 5eqtr4di 2795 . . . . . . . . . 10 (𝑛 = 𝑀 → (ℤ𝑛) = 𝑍)
1918feq2d 6621 . . . . . . . . 9 (𝑛 = 𝑀 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝐹:𝑍⟶(ℂ ↑m 𝑆)))
2019biimparc 480 . . . . . . . 8 ((𝐹:𝑍⟶(ℂ ↑m 𝑆) ∧ 𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
216, 20sylan 580 . . . . . . 7 ((𝜑𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
2216, 21impbida 798 . . . . . 6 (𝜑 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝑛 = 𝑀))
2322anbi1d 630 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
24 ulm2.g . . . . . 6 (𝜑𝐺:𝑆⟶ℂ)
2524biantrurd 533 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥))))
26 simp-4l 780 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝜑)
27 simpr 485 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑛 = 𝑀)
28 uzid 12667 . . . . . . . . . . . . . . . . . . . . 21 (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ𝑀))
2911, 28syl 17 . . . . . . . . . . . . . . . . . . . 20 (𝜑𝑀 ∈ (ℤ𝑀))
3029, 5eleqtrrdi 2849 . . . . . . . . . . . . . . . . . . 19 (𝜑𝑀𝑍)
3130adantr 481 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑀𝑍)
3227, 31eqeltrd 2838 . . . . . . . . . . . . . . . . 17 ((𝜑𝑛 = 𝑀) → 𝑛𝑍)
335uztrn2 12671 . . . . . . . . . . . . . . . . 17 ((𝑛𝑍𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
3432, 33sylan 580 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
355uztrn2 12671 . . . . . . . . . . . . . . . 16 ((𝑗𝑍𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3634, 35sylan 580 . . . . . . . . . . . . . . 15 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3736adantr 481 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑘𝑍)
38 simpr 485 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑧𝑆)
39 ulm2.b . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)
4026, 37, 38, 39syl12anc 834 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((𝐹𝑘)‘𝑧) = 𝐵)
41 ulm2.a . . . . . . . . . . . . . 14 ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)
4226, 41sylancom 588 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (𝐺𝑧) = 𝐴)
4340, 42oveq12d 7331 . . . . . . . . . . . 12 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (((𝐹𝑘)‘𝑧) − (𝐺𝑧)) = (𝐵𝐴))
4443fveq2d 6813 . . . . . . . . . . 11 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) = (abs‘(𝐵𝐴)))
4544breq1d 5095 . . . . . . . . . 10 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ (abs‘(𝐵𝐴)) < 𝑥))
4645ralbidva 3169 . . . . . . . . 9 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → (∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4746ralbidva 3169 . . . . . . . 8 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → (∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4847rexbidva 3170 . . . . . . 7 ((𝜑𝑛 = 𝑀) → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4948ralbidv 3171 . . . . . 6 ((𝜑𝑛 = 𝑀) → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5049pm5.32da 579 . . . . 5 (𝜑 → ((𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5123, 25, 503bitr3d 308 . . . 4 (𝜑 → ((𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
524, 51bitrid 282 . . 3 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5352rexbidv 3172 . 2 (𝜑 → (∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5418rexeqdv 3311 . . . . 5 (𝑛 = 𝑀 → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5554ralbidv 3171 . . . 4 (𝑛 = 𝑀 → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5655ceqsrexv 3594 . . 3 (𝑀 ∈ ℤ → (∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5711, 56syl 17 . 2 (𝜑 → (∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
583, 53, 573bitrd 304 1 (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086   = wceq 1540  wcel 2105  wral 3062  wrex 3071   class class class wbr 5085  dom cdm 5605  wf 6459  cfv 6463  (class class class)co 7313  m cmap 8661  cc 10939   < clt 11079  cmin 11275  cz 12389  cuz 12652  +crp 12800  abscabs 15014  𝑢culm 25606
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-rep 5222  ax-sep 5236  ax-nul 5243  ax-pow 5301  ax-pr 5365  ax-un 7626  ax-cnex 10997  ax-resscn 10998  ax-pre-lttri 11015  ax-pre-lttrn 11016
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-nfc 2887  df-ne 2942  df-nel 3048  df-ral 3063  df-rex 3072  df-reu 3351  df-rab 3405  df-v 3443  df-sbc 3726  df-csb 3842  df-dif 3899  df-un 3901  df-in 3903  df-ss 3913  df-nul 4267  df-if 4470  df-pw 4545  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4849  df-iun 4937  df-br 5086  df-opab 5148  df-mpt 5169  df-id 5505  df-po 5519  df-so 5520  df-xp 5611  df-rel 5612  df-cnv 5613  df-co 5614  df-dm 5615  df-rn 5616  df-res 5617  df-ima 5618  df-iota 6415  df-fun 6465  df-fn 6466  df-f 6467  df-f1 6468  df-fo 6469  df-f1o 6470  df-fv 6471  df-ov 7316  df-oprab 7317  df-mpo 7318  df-er 8544  df-map 8663  df-pm 8664  df-en 8780  df-dom 8781  df-sdom 8782  df-pnf 11081  df-mnf 11082  df-xr 11083  df-ltxr 11084  df-le 11085  df-neg 11278  df-z 12390  df-uz 12653  df-ulm 25607
This theorem is referenced by:  ulmi  25616  ulmclm  25617  ulmres  25618  ulmshftlem  25619  ulm0  25621  ulmcau  25625  ulmss  25627
  Copyright terms: Public domain W3C validator