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

Theorem ulm2 26414
Description: Simplify ulmval 26409 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 26409 . . 3 (𝑆𝑉 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
31, 2syl 17 . 2 (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
4 3anan12 1093 . . . 4 ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
5 ulm2.z . . . . . . . . . 10 𝑍 = (ℤ𝑀)
6 ulm2.f . . . . . . . . . . . 12 (𝜑𝐹:𝑍⟶(ℂ ↑m 𝑆))
76fdmd 6738 . . . . . . . . . . 11 (𝜑 → dom 𝐹 = 𝑍)
8 fdm 6737 . . . . . . . . . . 11 (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) → dom 𝐹 = (ℤ𝑛))
97, 8sylan9req 2787 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑍 = (ℤ𝑛))
105, 9eqtr3id 2780 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → (ℤ𝑀) = (ℤ𝑛))
11 ulm2.m . . . . . . . . . . 11 (𝜑𝑀 ∈ ℤ)
1211adantr 479 . . . . . . . . . 10 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 ∈ ℤ)
13 uz11 12899 . . . . . . . . . 10 (𝑀 ∈ ℤ → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1412, 13syl 17 . . . . . . . . 9 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → ((ℤ𝑀) = (ℤ𝑛) ↔ 𝑀 = 𝑛))
1510, 14mpbid 231 . . . . . . . 8 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑀 = 𝑛)
1615eqcomd 2732 . . . . . . 7 ((𝜑𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆)) → 𝑛 = 𝑀)
17 fveq2 6901 . . . . . . . . . . 11 (𝑛 = 𝑀 → (ℤ𝑛) = (ℤ𝑀))
1817, 5eqtr4di 2784 . . . . . . . . . 10 (𝑛 = 𝑀 → (ℤ𝑛) = 𝑍)
1918feq2d 6714 . . . . . . . . 9 (𝑛 = 𝑀 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝐹:𝑍⟶(ℂ ↑m 𝑆)))
2019biimparc 478 . . . . . . . 8 ((𝐹:𝑍⟶(ℂ ↑m 𝑆) ∧ 𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
216, 20sylan 578 . . . . . . 7 ((𝜑𝑛 = 𝑀) → 𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆))
2216, 21impbida 799 . . . . . 6 (𝜑 → (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ↔ 𝑛 = 𝑀))
2322anbi1d 629 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
24 ulm2.g . . . . . 6 (𝜑𝐺:𝑆⟶ℂ)
2524biantrurd 531 . . . . 5 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥))))
26 simp-4l 781 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝜑)
27 simpr 483 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑛 = 𝑀)
28 uzid 12889 . . . . . . . . . . . . . . . . . . . . 21 (𝑀 ∈ ℤ → 𝑀 ∈ (ℤ𝑀))
2911, 28syl 17 . . . . . . . . . . . . . . . . . . . 20 (𝜑𝑀 ∈ (ℤ𝑀))
3029, 5eleqtrrdi 2837 . . . . . . . . . . . . . . . . . . 19 (𝜑𝑀𝑍)
3130adantr 479 . . . . . . . . . . . . . . . . . 18 ((𝜑𝑛 = 𝑀) → 𝑀𝑍)
3227, 31eqeltrd 2826 . . . . . . . . . . . . . . . . 17 ((𝜑𝑛 = 𝑀) → 𝑛𝑍)
335uztrn2 12893 . . . . . . . . . . . . . . . . 17 ((𝑛𝑍𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
3432, 33sylan 578 . . . . . . . . . . . . . . . 16 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → 𝑗𝑍)
355uztrn2 12893 . . . . . . . . . . . . . . . 16 ((𝑗𝑍𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3634, 35sylan 578 . . . . . . . . . . . . . . 15 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → 𝑘𝑍)
3736adantr 479 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑘𝑍)
38 simpr 483 . . . . . . . . . . . . . 14 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → 𝑧𝑆)
39 ulm2.b . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)
4026, 37, 38, 39syl12anc 835 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((𝐹𝑘)‘𝑧) = 𝐵)
41 ulm2.a . . . . . . . . . . . . . 14 ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)
4226, 41sylancom 586 . . . . . . . . . . . . 13 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (𝐺𝑧) = 𝐴)
4340, 42oveq12d 7442 . . . . . . . . . . . 12 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (((𝐹𝑘)‘𝑧) − (𝐺𝑧)) = (𝐵𝐴))
4443fveq2d 6905 . . . . . . . . . . 11 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) = (abs‘(𝐵𝐴)))
4544breq1d 5163 . . . . . . . . . 10 (((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) ∧ 𝑧𝑆) → ((abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ (abs‘(𝐵𝐴)) < 𝑥))
4645ralbidva 3166 . . . . . . . . 9 ((((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) ∧ 𝑘 ∈ (ℤ𝑗)) → (∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4746ralbidva 3166 . . . . . . . 8 (((𝜑𝑛 = 𝑀) ∧ 𝑗 ∈ (ℤ𝑛)) → (∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4847rexbidva 3167 . . . . . . 7 ((𝜑𝑛 = 𝑀) → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
4948ralbidv 3168 . . . . . 6 ((𝜑𝑛 = 𝑀) → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5049pm5.32da 577 . . . . 5 (𝜑 → ((𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5123, 25, 503bitr3d 308 . . . 4 (𝜑 → ((𝐺:𝑆⟶ℂ ∧ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
524, 51bitrid 282 . . 3 (𝜑 → ((𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5352rexbidv 3169 . 2 (𝜑 → (∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑m 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥) ↔ ∃𝑛 ∈ ℤ (𝑛 = 𝑀 ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥)))
5418rexeqdv 3316 . . . . 5 (𝑛 = 𝑀 → (∃𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5554ralbidv 3168 . . . 4 (𝑛 = 𝑀 → (∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
5655ceqsrexv 3640 . . 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 394  w3a 1084   = wceq 1534  wcel 2099  wral 3051  wrex 3060   class class class wbr 5153  dom cdm 5682  wf 6550  cfv 6554  (class class class)co 7424  m cmap 8855  cc 11156   < clt 11298  cmin 11494  cz 12610  cuz 12874  +crp 13028  abscabs 15239  𝑢culm 26405
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5290  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433  ax-un 7746  ax-cnex 11214  ax-resscn 11215  ax-pre-lttri 11232  ax-pre-lttrn 11233
This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-iun 5003  df-br 5154  df-opab 5216  df-mpt 5237  df-id 5580  df-po 5594  df-so 5595  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-f1 6559  df-fo 6560  df-f1o 6561  df-fv 6562  df-ov 7427  df-oprab 7428  df-mpo 7429  df-er 8734  df-map 8857  df-pm 8858  df-en 8975  df-dom 8976  df-sdom 8977  df-pnf 11300  df-mnf 11301  df-xr 11302  df-ltxr 11303  df-le 11304  df-neg 11497  df-z 12611  df-uz 12875  df-ulm 26406
This theorem is referenced by:  ulmi  26415  ulmclm  26416  ulmres  26417  ulmshftlem  26418  ulm0  26420  ulmcau  26424  ulmss  26426
  Copyright terms: Public domain W3C validator