Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  limccog Structured version   Visualization version   GIF version

Theorem limccog 39279
Description: Limit of the composition of two functions. If the limit of 𝐹 at 𝐴 is 𝐵 and the limit of 𝐺 at 𝐵 is 𝐶, then the limit of 𝐺𝐹 at 𝐴 is 𝐶. With respect to limcco 23576 and limccnp 23574, here we drop continuity assumptions. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
Hypotheses
Ref Expression
limccog.1 (𝜑 → ran 𝐹 ⊆ (dom 𝐺 ∖ {𝐵}))
limccog.2 (𝜑𝐵 ∈ (𝐹 lim 𝐴))
limccog.3 (𝜑𝐶 ∈ (𝐺 lim 𝐵))
Assertion
Ref Expression
limccog (𝜑𝐶 ∈ ((𝐺𝐹) lim 𝐴))

Proof of Theorem limccog
Dummy variables 𝑢 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 limccl 23558 . . 3 (𝐺 lim 𝐵) ⊆ ℂ
2 limccog.3 . . 3 (𝜑𝐶 ∈ (𝐺 lim 𝐵))
31, 2sseldi 3585 . 2 (𝜑𝐶 ∈ ℂ)
4 limcrcl 23557 . . . . . . . . . . . 12 (𝐶 ∈ (𝐺 lim 𝐵) → (𝐺:dom 𝐺⟶ℂ ∧ dom 𝐺 ⊆ ℂ ∧ 𝐵 ∈ ℂ))
52, 4syl 17 . . . . . . . . . . 11 (𝜑 → (𝐺:dom 𝐺⟶ℂ ∧ dom 𝐺 ⊆ ℂ ∧ 𝐵 ∈ ℂ))
65simp1d 1071 . . . . . . . . . 10 (𝜑𝐺:dom 𝐺⟶ℂ)
75simp2d 1072 . . . . . . . . . 10 (𝜑 → dom 𝐺 ⊆ ℂ)
85simp3d 1073 . . . . . . . . . 10 (𝜑𝐵 ∈ ℂ)
9 eqid 2621 . . . . . . . . . 10 (TopOpen‘ℂfld) = (TopOpen‘ℂfld)
106, 7, 8, 9ellimc2 23560 . . . . . . . . 9 (𝜑 → (𝐶 ∈ (𝐺 lim 𝐵) ↔ (𝐶 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝐶𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)))))
112, 10mpbid 222 . . . . . . . 8 (𝜑 → (𝐶 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝐶𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢))))
1211simprd 479 . . . . . . 7 (𝜑 → ∀𝑢 ∈ (TopOpen‘ℂfld)(𝐶𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)))
1312r19.21bi 2927 . . . . . 6 ((𝜑𝑢 ∈ (TopOpen‘ℂfld)) → (𝐶𝑢 → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)))
1413imp 445 . . . . 5 (((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) → ∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢))
15 simp1ll 1122 . . . . . . . 8 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → 𝜑)
16 simp2 1060 . . . . . . . 8 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → 𝑣 ∈ (TopOpen‘ℂfld))
17 simp3l 1087 . . . . . . . 8 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → 𝐵𝑣)
18 limccog.2 . . . . . . . . . . . 12 (𝜑𝐵 ∈ (𝐹 lim 𝐴))
19 limcrcl 23557 . . . . . . . . . . . . . . 15 (𝐵 ∈ (𝐹 lim 𝐴) → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐴 ∈ ℂ))
2018, 19syl 17 . . . . . . . . . . . . . 14 (𝜑 → (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ ∧ 𝐴 ∈ ℂ))
2120simp1d 1071 . . . . . . . . . . . . 13 (𝜑𝐹:dom 𝐹⟶ℂ)
2220simp2d 1072 . . . . . . . . . . . . 13 (𝜑 → dom 𝐹 ⊆ ℂ)
2320simp3d 1073 . . . . . . . . . . . . 13 (𝜑𝐴 ∈ ℂ)
2421, 22, 23, 9ellimc2 23560 . . . . . . . . . . . 12 (𝜑 → (𝐵 ∈ (𝐹 lim 𝐴) ↔ (𝐵 ∈ ℂ ∧ ∀𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣)))))
2518, 24mpbid 222 . . . . . . . . . . 11 (𝜑 → (𝐵 ∈ ℂ ∧ ∀𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣))))
2625simprd 479 . . . . . . . . . 10 (𝜑 → ∀𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣)))
2726r19.21bi 2927 . . . . . . . . 9 ((𝜑𝑣 ∈ (TopOpen‘ℂfld)) → (𝐵𝑣 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣)))
2827imp 445 . . . . . . . 8 (((𝜑𝑣 ∈ (TopOpen‘ℂfld)) ∧ 𝐵𝑣) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣))
2915, 16, 17, 28syl21anc 1322 . . . . . . 7 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣))
30 imaco 5604 . . . . . . . . . . 11 ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) = (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))))
3115ad2antrr 761 . . . . . . . . . . . 12 ((((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → 𝜑)
32 simpl3r 1115 . . . . . . . . . . . . 13 (((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) → (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)
3332adantr 481 . . . . . . . . . . . 12 ((((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)
34 simpr 477 . . . . . . . . . . . 12 ((((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣)
35 simpr 477 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣)
36 imassrn 5441 . . . . . . . . . . . . . . . . . 18 (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ ran 𝐹
37 limccog.1 . . . . . . . . . . . . . . . . . 18 (𝜑 → ran 𝐹 ⊆ (dom 𝐺 ∖ {𝐵}))
3836, 37syl5ss 3598 . . . . . . . . . . . . . . . . 17 (𝜑 → (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ (dom 𝐺 ∖ {𝐵}))
3938adantr 481 . . . . . . . . . . . . . . . 16 ((𝜑 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ (dom 𝐺 ∖ {𝐵}))
4035, 39ssind 3820 . . . . . . . . . . . . . . 15 ((𝜑 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ (𝑣 ∩ (dom 𝐺 ∖ {𝐵})))
41 imass2 5465 . . . . . . . . . . . . . . 15 ((𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ (𝑣 ∩ (dom 𝐺 ∖ {𝐵})) → (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴})))) ⊆ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))))
4240, 41syl 17 . . . . . . . . . . . . . 14 ((𝜑 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴})))) ⊆ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))))
4342adantlr 750 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴})))) ⊆ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))))
44 simplr 791 . . . . . . . . . . . . 13 (((𝜑 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)
4543, 44sstrd 3597 . . . . . . . . . . . 12 (((𝜑 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴})))) ⊆ 𝑢)
4631, 33, 34, 45syl21anc 1322 . . . . . . . . . . 11 ((((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐺 “ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴})))) ⊆ 𝑢)
4730, 46syl5eqss 3633 . . . . . . . . . 10 ((((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)
4847ex 450 . . . . . . . . 9 (((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) → ((𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣 → ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢))
4948anim2d 588 . . . . . . . 8 (((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) ∧ 𝑤 ∈ (TopOpen‘ℂfld)) → ((𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → (𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))
5049reximdva 3012 . . . . . . 7 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → (∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ (𝐹 “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑣) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))
5129, 50mpd 15 . . . . . 6 ((((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) ∧ 𝑣 ∈ (TopOpen‘ℂfld) ∧ (𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢)) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢))
5251rexlimdv3a 3027 . . . . 5 (((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) → (∃𝑣 ∈ (TopOpen‘ℂfld)(𝐵𝑣 ∧ (𝐺 “ (𝑣 ∩ (dom 𝐺 ∖ {𝐵}))) ⊆ 𝑢) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))
5314, 52mpd 15 . . . 4 (((𝜑𝑢 ∈ (TopOpen‘ℂfld)) ∧ 𝐶𝑢) → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢))
5453ex 450 . . 3 ((𝜑𝑢 ∈ (TopOpen‘ℂfld)) → (𝐶𝑢 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))
5554ralrimiva 2961 . 2 (𝜑 → ∀𝑢 ∈ (TopOpen‘ℂfld)(𝐶𝑢 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))
56 ffun 6010 . . . . . . 7 (𝐹:dom 𝐹⟶ℂ → Fun 𝐹)
5721, 56syl 17 . . . . . 6 (𝜑 → Fun 𝐹)
58 fdmrn 6026 . . . . . 6 (Fun 𝐹𝐹:dom 𝐹⟶ran 𝐹)
5957, 58sylib 208 . . . . 5 (𝜑𝐹:dom 𝐹⟶ran 𝐹)
6037difss2d 3723 . . . . 5 (𝜑 → ran 𝐹 ⊆ dom 𝐺)
6159, 60fssd 6019 . . . 4 (𝜑𝐹:dom 𝐹⟶dom 𝐺)
62 fco 6020 . . . 4 ((𝐺:dom 𝐺⟶ℂ ∧ 𝐹:dom 𝐹⟶dom 𝐺) → (𝐺𝐹):dom 𝐹⟶ℂ)
636, 61, 62syl2anc 692 . . 3 (𝜑 → (𝐺𝐹):dom 𝐹⟶ℂ)
6463, 22, 23, 9ellimc2 23560 . 2 (𝜑 → (𝐶 ∈ ((𝐺𝐹) lim 𝐴) ↔ (𝐶 ∈ ℂ ∧ ∀𝑢 ∈ (TopOpen‘ℂfld)(𝐶𝑢 → ∃𝑤 ∈ (TopOpen‘ℂfld)(𝐴𝑤 ∧ ((𝐺𝐹) “ (𝑤 ∩ (dom 𝐹 ∖ {𝐴}))) ⊆ 𝑢)))))
653, 55, 64mpbir2and 956 1 (𝜑𝐶 ∈ ((𝐺𝐹) lim 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  w3a 1036  wcel 1987  wral 2907  wrex 2908  cdif 3556  cin 3558  wss 3559  {csn 4153  dom cdm 5079  ran crn 5080  cima 5082  ccom 5083  Fun wfun 5846  wf 5848  cfv 5852  (class class class)co 6610  cc 9885  TopOpenctopn 16010  fldccnfld 19674   lim climc 23545
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-cnex 9943  ax-resscn 9944  ax-1cn 9945  ax-icn 9946  ax-addcl 9947  ax-addrcl 9948  ax-mulcl 9949  ax-mulrcl 9950  ax-mulcom 9951  ax-addass 9952  ax-mulass 9953  ax-distr 9954  ax-i2m1 9955  ax-1ne0 9956  ax-1rid 9957  ax-rnegex 9958  ax-rrecex 9959  ax-cnre 9960  ax-pre-lttri 9961  ax-pre-lttrn 9962  ax-pre-ltadd 9963  ax-pre-mulgt0 9964  ax-pre-sup 9965
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-pss 3575  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5644  df-ord 5690  df-on 5691  df-lim 5692  df-suc 5693  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-riota 6571  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-om 7020  df-1st 7120  df-2nd 7121  df-wrecs 7359  df-recs 7420  df-rdg 7458  df-1o 7512  df-oadd 7516  df-er 7694  df-map 7811  df-pm 7812  df-en 7907  df-dom 7908  df-sdom 7909  df-fin 7910  df-fi 8268  df-sup 8299  df-inf 8300  df-pnf 10027  df-mnf 10028  df-xr 10029  df-ltxr 10030  df-le 10031  df-sub 10219  df-neg 10220  df-div 10636  df-nn 10972  df-2 11030  df-3 11031  df-4 11032  df-5 11033  df-6 11034  df-7 11035  df-8 11036  df-9 11037  df-n0 11244  df-z 11329  df-dec 11445  df-uz 11639  df-q 11740  df-rp 11784  df-xneg 11897  df-xadd 11898  df-xmul 11899  df-fz 12276  df-seq 12749  df-exp 12808  df-cj 13780  df-re 13781  df-im 13782  df-sqrt 13916  df-abs 13917  df-struct 15790  df-ndx 15791  df-slot 15792  df-base 15793  df-plusg 15882  df-mulr 15883  df-starv 15884  df-tset 15888  df-ple 15889  df-ds 15892  df-unif 15893  df-rest 16011  df-topn 16012  df-topgen 16032  df-psmet 19666  df-xmet 19667  df-met 19668  df-bl 19669  df-mopn 19670  df-cnfld 19675  df-top 20627  df-topon 20644  df-topsp 20657  df-bases 20670  df-cnp 20951  df-xms 22044  df-ms 22045  df-limc 23549
This theorem is referenced by:  dirkercncflem2  39649  fourierdlem53  39704  fourierdlem93  39744  fourierdlem111  39762
  Copyright terms: Public domain W3C validator