Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  heiborlem4 Structured version   Visualization version   GIF version

Theorem heiborlem4 39016
Description: Lemma for heibor 39023. Using the function 𝑇 constructed in heiborlem3 39015, construct an infinite path in 𝐺. (Contributed by Jeff Madsen, 23-Jan-2014.)
Hypotheses
Ref Expression
heibor.1 𝐽 = (MetOpen‘𝐷)
heibor.3 𝐾 = {𝑢 ∣ ¬ ∃𝑣 ∈ (𝒫 𝑈 ∩ Fin)𝑢 ⊆ ∪ 𝑣}
heibor.4 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
heibor.5 𝐵 = (𝑧 ∈ 𝑋, 𝑚 ∈ ℕ0 ↦ (𝑧(ball‘𝐷)(1 / (2↑𝑚))))
heibor.6 (𝜑 → 𝐷 ∈ (CMet‘𝑋))
heibor.7 (𝜑 → 𝐹:ℕ0⟶(𝒫 𝑋 ∩ Fin))
heibor.8 (𝜑 → ∀𝑛 ∈ ℕ0 𝑋 = ∪ 𝑦 ∈ (𝐹‘𝑛)(𝑦𝐵𝑛))
heibor.9 (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
heibor.10 (𝜑 → 𝐶𝐺0)
heibor.11 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))
Assertion
Ref Expression
heiborlem4 ((𝜑 ∧ 𝐴 ∈ ℕ0) → (𝑆‘𝐴)𝐺𝐴)
Distinct variable groups:   𝑥,𝑛,𝑦,𝐴   𝑢,𝑛,𝐹,𝑥,𝑦   𝑥,𝐺   𝜑,𝑥   𝑚,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧,𝐷   𝑇,𝑚,𝑛,𝑥,𝑦,𝑧   𝐵,𝑛,𝑢,𝑣,𝑦   𝑚,𝐽,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝑈,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝑆,𝑚,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝑚,𝑋,𝑛,𝑢,𝑣,𝑥,𝑦,𝑧   𝐶,𝑚,𝑛,𝑢,𝑣,𝑦   𝑛,𝐾,𝑥,𝑦,𝑧   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑦, 𝑧, 𝑣, 𝑢, 𝑚, 𝑛)   𝐴(𝑧, 𝑣, 𝑢, 𝑚)   𝐵(𝑧, 𝑚)   𝐶(𝑥, 𝑧)   𝑇(𝑣, 𝑢)   𝑈(𝑚)   𝐹(𝑧, 𝑣, 𝑚)   𝐺(𝑦, 𝑧, 𝑣, 𝑢, 𝑚, 𝑛)   𝐾(𝑣, 𝑢, 𝑚)

Proof of Theorem heiborlem4
Dummy variable 𝑘 is distinct from all other variables.
StepHypRef Expression
1 fveq2 6915 . . . . 5 (𝑥 = 0 → (𝑆‘𝑥) = (𝑆‘0))
2 id 23 . . . . 5 (𝑥 = 0 → 𝑥 = 0)
31, 2breq12d 5120 . . . 4 (𝑥 = 0 → ((𝑆‘𝑥)𝐺𝑥 ↔ (𝑆‘0)𝐺0))
43imbi2d 343 . . 3 (𝑥 = 0 → ((𝜑 → (𝑆‘𝑥)𝐺𝑥) ↔ (𝜑 → (𝑆‘0)𝐺0)))
5 fveq2 6915 . . . . 5 (𝑥 = 𝑘 → (𝑆‘𝑥) = (𝑆‘𝑘))
6 id 23 . . . . 5 (𝑥 = 𝑘 → 𝑥 = 𝑘)
75, 6breq12d 5120 . . . 4 (𝑥 = 𝑘 → ((𝑆‘𝑥)𝐺𝑥 ↔ (𝑆‘𝑘)𝐺𝑘))
87imbi2d 343 . . 3 (𝑥 = 𝑘 → ((𝜑 → (𝑆‘𝑥)𝐺𝑥) ↔ (𝜑 → (𝑆‘𝑘)𝐺𝑘)))
9 fveq2 6915 . . . . 5 (𝑥 = (𝑘 + 1) → (𝑆‘𝑥) = (𝑆‘(𝑘 + 1)))
10 id 23 . . . . 5 (𝑥 = (𝑘 + 1) → 𝑥 = (𝑘 + 1))
119, 10breq12d 5120 . . . 4 (𝑥 = (𝑘 + 1) → ((𝑆‘𝑥)𝐺𝑥 ↔ (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1)))
1211imbi2d 343 . . 3 (𝑥 = (𝑘 + 1) → ((𝜑 → (𝑆‘𝑥)𝐺𝑥) ↔ (𝜑 → (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1))))
13 fveq2 6915 . . . . 5 (𝑥 = 𝐴 → (𝑆‘𝑥) = (𝑆‘𝐴))
14 id 23 . . . . 5 (𝑥 = 𝐴 → 𝑥 = 𝐴)
1513, 14breq12d 5120 . . . 4 (𝑥 = 𝐴 → ((𝑆‘𝑥)𝐺𝑥 ↔ (𝑆‘𝐴)𝐺𝐴))
1615imbi2d 343 . . 3 (𝑥 = 𝐴 → ((𝜑 → (𝑆‘𝑥)𝐺𝑥) ↔ (𝜑 → (𝑆‘𝐴)𝐺𝐴)))
17 heibor.11 . . . . . . 7 𝑆 = seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))
1817fveq1i 6916 . . . . . 6 (𝑆‘0) = (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘0)
19 0z 12743 . . . . . . 7 0 ∈ ℤ
20 seq1 14196 . . . . . . 7 (0 ∈ ℤ → (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘0))
2119, 20ax-mp 5 . . . . . 6 (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘0)
2218, 21eqtri 2789 . . . . 5 (𝑆‘0) = ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘0)
23 0nn0 12660 . . . . . 6 0 ∈ ℕ0
24 heibor.10 . . . . . . 7 (𝜑 → 𝐶𝐺0)
25 heibor.4 . . . . . . . . 9 𝐺 = {⟨𝑦, 𝑛⟩ ∣ (𝑛 ∈ ℕ0 ∧ 𝑦 ∈ (𝐹‘𝑛) ∧ (𝑦𝐵𝑛) ∈ 𝐾)}
2625relopabi 5808 . . . . . . . 8 Rel 𝐺
2726brrelex1i 5713 . . . . . . 7 (𝐶𝐺0 → 𝐶 ∈ V)
2824, 27syl 18 . . . . . 6 (𝜑 → 𝐶 ∈ V)
29 iftrue 4490 . . . . . . 7 (𝑚 = 0 → if(𝑚 = 0, 𝐶, (𝑚 − 1)) = 𝐶)
30 eqid 2766 . . . . . . 7 (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))) = (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))
3129, 30fvmptg 7021 . . . . . 6 ((0 ∈ ℕ0 ∧ 𝐶 ∈ V) → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘0) = 𝐶)
3223, 28, 31sylancr 599 . . . . 5 (𝜑 → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘0) = 𝐶)
3322, 32eqtrid 2813 . . . 4 (𝜑 → (𝑆‘0) = 𝐶)
3433, 24eqbrtrd 5132 . . 3 (𝜑 → (𝑆‘0)𝐺0)
35 df-br 5108 . . . . . 6 ((𝑆‘𝑘)𝐺𝑘 ↔ ⟨(𝑆‘𝑘), 𝑘⟩ ∈ 𝐺)
36 heibor.9 . . . . . . 7 (𝜑 → ∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾))
37 fveq2 6915 . . . . . . . . . . 11 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (𝑇‘𝑥) = (𝑇‘⟨(𝑆‘𝑘), 𝑘⟩))
38 df-ov 7453 . . . . . . . . . . 11 ((𝑆‘𝑘)𝑇𝑘) = (𝑇‘⟨(𝑆‘𝑘), 𝑘⟩)
3937, 38eqtr4di 2819 . . . . . . . . . 10 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (𝑇‘𝑥) = ((𝑆‘𝑘)𝑇𝑘))
40 fvex 6928 . . . . . . . . . . . 12 (𝑆‘𝑘) ∈ V
41 vex 3457 . . . . . . . . . . . 12 𝑘 ∈ V
4240, 41op2ndd 8045 . . . . . . . . . . 11 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (2nd ‘𝑥) = 𝑘)
4342oveq1d 7465 . . . . . . . . . 10 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → ((2nd ‘𝑥) + 1) = (𝑘 + 1))
4439, 43breq12d 5120 . . . . . . . . 9 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ↔ ((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1)))
45 fveq2 6915 . . . . . . . . . . . 12 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (𝐵‘𝑥) = (𝐵‘⟨(𝑆‘𝑘), 𝑘⟩))
46 df-ov 7453 . . . . . . . . . . . 12 ((𝑆‘𝑘)𝐵𝑘) = (𝐵‘⟨(𝑆‘𝑘), 𝑘⟩)
4745, 46eqtr4di 2819 . . . . . . . . . . 11 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (𝐵‘𝑥) = ((𝑆‘𝑘)𝐵𝑘))
4839, 43oveq12d 7468 . . . . . . . . . . 11 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1)) = (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1)))
4947, 48ineq12d 4120 . . . . . . . . . 10 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) = (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))))
5049eleq1d 2852 . . . . . . . . 9 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾 ↔ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾))
5144, 50anbi12d 644 . . . . . . . 8 (𝑥 = ⟨(𝑆‘𝑘), 𝑘⟩ → (((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) ↔ (((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) ∧ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾)))
5251rspccv 3576 . . . . . . 7 (∀𝑥 ∈ 𝐺 ((𝑇‘𝑥)𝐺((2nd ‘𝑥) + 1) ∧ ((𝐵‘𝑥) ∩ ((𝑇‘𝑥)𝐵((2nd ‘𝑥) + 1))) ∈ 𝐾) → (⟨(𝑆‘𝑘), 𝑘⟩ ∈ 𝐺 → (((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) ∧ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾)))
5336, 52syl 18 . . . . . 6 (𝜑 → (⟨(𝑆‘𝑘), 𝑘⟩ ∈ 𝐺 → (((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) ∧ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾)))
5435, 53biimtrid 245 . . . . 5 (𝜑 → ((𝑆‘𝑘)𝐺𝑘 → (((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) ∧ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾)))
55 seqp1 14198 . . . . . . . . . . 11 (𝑘 ∈ (ℤ≥‘0) → (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘(𝑘 + 1)) = ((seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1))))
56 nn0uz 13042 . . . . . . . . . . 11 ℕ0 = (ℤ≥‘0)
5755, 56eleq2s 2885 . . . . . . . . . 10 (𝑘 ∈ ℕ0 → (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘(𝑘 + 1)) = ((seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1))))
5817fveq1i 6916 . . . . . . . . . 10 (𝑆‘(𝑘 + 1)) = (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘(𝑘 + 1))
5917fveq1i 6916 . . . . . . . . . . 11 (𝑆‘𝑘) = (seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘𝑘)
6059oveq1i 7460 . . . . . . . . . 10 ((𝑆‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1))) = ((seq0(𝑇, (𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1))))‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1)))
6157, 58, 603eqtr4g 2826 . . . . . . . . 9 (𝑘 ∈ ℕ0 → (𝑆‘(𝑘 + 1)) = ((𝑆‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1))))
62 eqeq1 2770 . . . . . . . . . . . . 13 (𝑚 = (𝑘 + 1) → (𝑚 = 0 ↔ (𝑘 + 1) = 0))
63 oveq1 7457 . . . . . . . . . . . . 13 (𝑚 = (𝑘 + 1) → (𝑚 − 1) = ((𝑘 + 1) − 1))
6462, 63ifbieq2d 4511 . . . . . . . . . . . 12 (𝑚 = (𝑘 + 1) → if(𝑚 = 0, 𝐶, (𝑚 − 1)) = if((𝑘 + 1) = 0, 𝐶, ((𝑘 + 1) − 1)))
65 peano2nn0 12685 . . . . . . . . . . . 12 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ0)
66 nn0p1nn 12684 . . . . . . . . . . . . . 14 (𝑘 ∈ ℕ0 → (𝑘 + 1) ∈ ℕ)
67 nnne0 12411 . . . . . . . . . . . . . . 15 ((𝑘 + 1) ∈ ℕ → (𝑘 + 1) ≠ 0)
6867neneqd 2967 . . . . . . . . . . . . . 14 ((𝑘 + 1) ∈ ℕ → ¬ (𝑘 + 1) = 0)
69 iffalse 4493 . . . . . . . . . . . . . 14 (¬ (𝑘 + 1) = 0 → if((𝑘 + 1) = 0, 𝐶, ((𝑘 + 1) − 1)) = ((𝑘 + 1) − 1))
7066, 68, 693syl 19 . . . . . . . . . . . . 13 (𝑘 ∈ ℕ0 → if((𝑘 + 1) = 0, 𝐶, ((𝑘 + 1) − 1)) = ((𝑘 + 1) − 1))
71 ovex 7483 . . . . . . . . . . . . 13 ((𝑘 + 1) − 1) ∈ V
7270, 71eqeltrdi 2875 . . . . . . . . . . . 12 (𝑘 ∈ ℕ0 → if((𝑘 + 1) = 0, 𝐶, ((𝑘 + 1) − 1)) ∈ V)
7330, 64, 65, 72fvmptd3 7047 . . . . . . . . . . 11 (𝑘 ∈ ℕ0 → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1)) = if((𝑘 + 1) = 0, 𝐶, ((𝑘 + 1) − 1)))
74 nn0cn 12655 . . . . . . . . . . . 12 (𝑘 ∈ ℕ0 → 𝑘 ∈ ℂ)
75 ax-1cn 11296 . . . . . . . . . . . 12 1 ∈ ℂ
76 pncan 11601 . . . . . . . . . . . 12 ((𝑘 ∈ ℂ ∧ 1 ∈ ℂ) → ((𝑘 + 1) − 1) = 𝑘)
7774, 75, 76sylancl 598 . . . . . . . . . . 11 (𝑘 ∈ ℕ0 → ((𝑘 + 1) − 1) = 𝑘)
7873, 70, 773eqtrd 2805 . . . . . . . . . 10 (𝑘 ∈ ℕ0 → ((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1)) = 𝑘)
7978oveq2d 7466 . . . . . . . . 9 (𝑘 ∈ ℕ0 → ((𝑆‘𝑘)𝑇((𝑚 ∈ ℕ0 ↦ if(𝑚 = 0, 𝐶, (𝑚 − 1)))‘(𝑘 + 1))) = ((𝑆‘𝑘)𝑇𝑘))
8061, 79eqtrd 2801 . . . . . . . 8 (𝑘 ∈ ℕ0 → (𝑆‘(𝑘 + 1)) = ((𝑆‘𝑘)𝑇𝑘))
8180breq1d 5117 . . . . . . 7 (𝑘 ∈ ℕ0 → ((𝑆‘(𝑘 + 1))𝐺(𝑘 + 1) ↔ ((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1)))
8281biimprd 251 . . . . . 6 (𝑘 ∈ ℕ0 → (((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) → (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1)))
8382adantrd 497 . . . . 5 (𝑘 ∈ ℕ0 → ((((𝑆‘𝑘)𝑇𝑘)𝐺(𝑘 + 1) ∧ (((𝑆‘𝑘)𝐵𝑘) ∩ (((𝑆‘𝑘)𝑇𝑘)𝐵(𝑘 + 1))) ∈ 𝐾) → (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1)))
8454, 83syl9r 79 . . . 4 (𝑘 ∈ ℕ0 → (𝜑 → ((𝑆‘𝑘)𝐺𝑘 → (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1))))
8584a2d 30 . . 3 (𝑘 ∈ ℕ0 → ((𝜑 → (𝑆‘𝑘)𝐺𝑘) → (𝜑 → (𝑆‘(𝑘 + 1))𝐺(𝑘 + 1))))
864, 8, 12, 16, 34, 85nn0ind 12833 . 2 (𝐴 ∈ ℕ0 → (𝜑 → (𝑆‘𝐴)𝐺𝐴))
8786impcom 413 1 ((𝜑 ∧ 𝐴 ∈ ℕ0) → (𝑆‘𝐴)𝐺𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1104   = wceq 1572   ∈ wcel 2150  {cab 2744  ∀wral 3083  ∃wrex 3093  Vcvv 3453   ⊆ wss 3899   ∩ cin 4091  ifcif 4484  𝒫 cpw 4559  ⟨cop 4839  ∪ cuni 4871  ∪ ciun 4955   class class class wbr 5107  {copab 5172   ↦ cmpt 5191  ⟶wf 6561  ‘cfv 6565  (class class class)co 7450   ∈ cmpo 7452  2nd c2nd 8033  Fincfn 9010  ℂcc 11236  0cc0 11238  1c1 11239   + caddc 11241   − cmin 11579   / cdiv 12012  ℕcn 12374  2c2 12436  ℕ0cn0 12645  ℤcz 12732  ℤ≥cuz 13004  seqcseq 14183  ↑cexp 14243  ballcbl 21718  MetOpencmopn 21721  CMetccmet 25632
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-cnex 11294  ax-resscn 11295  ax-1cn 11296  ax-icn 11297  ax-addcl 11298  ax-addrcl 11299  ax-mulcl 11300  ax-mulrcl 11301  ax-mulcom 11302  ax-addass 11303  ax-mulass 11304  ax-distr 11305  ax-i2m1 11306  ax-1ne0 11307  ax-1rid 11308  ax-rnegex 11309  ax-rrecex 11310  ax-cnre 11311  ax-pre-lttri 11312  ax-pre-lttrn 11313  ax-pre-ltadd 11314  ax-pre-mulgt0 11315
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-nel 3069  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-er 8754  df-en 9011  df-dom 9012  df-sdom 9013  df-pnf 11383  df-mnf 11384  df-xr 11385  df-ltxr 11386  df-le 11387  df-sub 11581  df-neg 11582  df-nn 12375  df-n0 12646  df-z 12733  df-uz 13005  df-seq 14184
This theorem is used by:  heiborlem5  39017  heiborlem6  39018  heiborlem8  39020
  Copyright terms: Public domain W3C validator