| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Express the binary relation "sequence F converges to point P " in a metric space." |
| Ref | Expression |
|---|---|
| lmbrnns.1 | ⊢ X = dom dom D |
| lmbrnns.2 | ⊢ (k ∈ ℕ → A = (F ‘k)) |
| Ref | Expression |
|---|---|
| lmbrnns | ⊢ ((D ∈ Met ⋀ P ∈ X ⋀ F:ℕ–→X) → (F(⇝m ‘D)P ↔ ∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → (ADP) < x))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | lmbrnns.1 | . . 3 ⊢ X = dom dom D | |
| 2 | 1z 6165 | . . 3 ⊢ 1 ∈ ℤ | |
| 3 | nnuz 6389 | . . 3 ⊢ ℕ = (ℤ≥ ‘1) | |
| 4 | 1, 2, 3 | lmbrf2 7940 | . 2 ⊢ ((D ∈ Met ⋀ P ∈ X ⋀ F:ℕ–→X) → (F(⇝m ‘D)P ↔ ∀x ∈ ℝ (0 < x → ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x)))) |
| 5 | lmbrnns.2 | . . . . . . . . 9 ⊢ (k ∈ ℕ → A = (F ‘k)) | |
| 6 | 5 | opreq1d 3989 | . . . . . . . 8 ⊢ (k ∈ ℕ → (ADP) = ((F ‘k)DP)) |
| 7 | 6 | breq1d 2642 | . . . . . . 7 ⊢ (k ∈ ℕ → ((ADP) < x ↔ ((F ‘k)DP) < x)) |
| 8 | 7 | imbi2d 615 | . . . . . 6 ⊢ (k ∈ ℕ → ((j ≤ k → (ADP) < x) ↔ (j ≤ k → ((F ‘k)DP) < x))) |
| 9 | 8 | ralbiia 1680 | . . . . 5 ⊢ (∀k ∈ ℕ (j ≤ k → (ADP) < x) ↔ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x)) |
| 10 | 9 | rexbii 1675 | . . . 4 ⊢ (∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → (ADP) < x) ↔ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x)) |
| 11 | 10 | ralbii 1674 | . . 3 ⊢ (∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → (ADP) < x) ↔ ∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x)) |
| 12 | ralrp 6300 | . . 3 ⊢ (∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x) ↔ ∀x ∈ ℝ (0 < x → ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x))) | |
| 13 | 11, 12 | bitr2 174 | . 2 ⊢ (∀x ∈ ℝ (0 < x → ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → ((F ‘k)DP) < x)) ↔ ∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → (ADP) < x)) |
| 14 | 4, 13 | syl6bb 539 | 1 ⊢ ((D ∈ Met ⋀ P ∈ X ⋀ F:ℕ–→X) → (F(⇝m ‘D)P ↔ ∀x ∈ ℝ+ ∃j ∈ ℕ ∀k ∈ ℕ (j ≤ k → (ADP) < x))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 3 ↔ wb 146 ⋀ w3a 779 = wceq 960 ∈ wcel 962 ∀wral 1652 ∃wrex 1653 class class class wbr 2632 dom cdm 3184 –→wf 3192 ‘cfv 3196 (class class class)co 3977 ℝcr 5246 0cc0 5247 1c1 5248 ≤ cle 5308 ℕcn 5309 ℝ+crp 5313 < clt 5499 Metcme 7798 ⇝mclm 7928 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 966 ax-gen 967 ax-8 968 ax-9 969 ax-10 970 ax-11 971 ax-12 972 ax-13 973 ax-14 974 ax-17 975 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1129 ax-10o 1146 ax-16 1216 ax-11o 1224 ax-ext 1466 ax-rep 2706 ax-sep 2716 ax-nul 2723 ax-pow 2756 ax-pr 2793 ax-un 2880 ax-inf2 4637 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3or 780 df-3an 781 df-ex 985 df-sb 1178 df-eu 1388 df-mo 1389 df-clab 1471 df-cleq 1476 df-clel 1479 df-ne 1594 df-nel 1595 df-ral 1656 df-rex 1657 df-reu 1658 df-rab 1659 df-v 1819 df-sbc 1949 df-csb 2010 df-dif 2058 df-un 2059 df-in 2060 df-ss 2062 df-pss 2064 df-nul 2290 df-if 2372 df-pw 2412 df-sn 2422 df-pr 2423 df-tp 2425 df-op 2426 df-uni 2516 df-int 2546 df-iun 2580 df-br 2633 df-opab 2680 df-tr 2694 df-eprel 2846 df-id 2849 df-po 2854 df-so 2864 df-fr 2931 df-we 2948 df-ord 2965 df-on 2966 df-lim 2967 df-suc 2968 df-om 3146 df-xp 3198 df-rel 3199 df-cnv 3200 df-co 3201 df-dm 3202 df-rn 3203 df-res 3204 df-ima 3205 df-fun 3206 df-fn 3207 df-f 3208 df-f1 3209 df-fo 3210 df-f1o 3211 df-fv 3212 df-rdg 3946 df-opr 3979 df-oprab 3980 df-1st 4093 df-2nd 4094 df-1o 4147 df-oadd 4149 df-omul 4150 df-er 4275 df-ec 4277 df-qs 4280 df-en 4382 df-dom 4383 df-sdom 4384 df-ni 5013 df-pli 5014 df-mi 5015 df-lti 5016 df-plpq 5048 df-mpq 5049 df-enq 5050 df-nq 5051 df-plq 5052 df-mq 5053 df-rq 5054 df-ltq 5055 df-1q 5056 df-np 5099 df-1p 5100 df-plp 5101 df-mp 5102 df-ltp 5103 df-plpr 5177 df-mpr 5178 df-enr 5179 df-nr 5180 df-plr 5181 df-mr 5182 df-ltr 5183 df-0r 5184 df-1r 5185 df-m1r 5186 df-c 5253 df-0 5254 df-1 5255 df-i 5256 df-r 5257 df-plus 5258 df-mul 5259 df-lt 5260 df-sub 5369 df-neg 5371 df-pnf 5500 df-mnf 5501 df-xr 5502 df-ltxr 5503 df-le 5504 df-n 5931 df-z 6142 df-rp 6292 df-uz 6368 df-lm 7931 |