| Mathbox for Stefan O'Rear |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > irrapxlem6 | Structured version Visualization version GIF version | ||
| Description: Lemma for irrapx1 43256. Explicit description of a non-closed set. (Contributed by Stefan O'Rear, 13-Sep-2014.) |
| Ref | Expression |
|---|---|
| irrapxlem6 | ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} (abs‘(𝑥 − 𝐴)) < 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 769 | . . . 4 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → 𝑎 ∈ ℚ) | |
| 2 | simpr1 1196 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → 0 < 𝑎) | |
| 3 | simpr3 1198 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2)) | |
| 4 | 2, 3 | jca 511 | . . . 4 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) |
| 5 | breq2 5089 | . . . . . 6 ⊢ (𝑦 = 𝑎 → (0 < 𝑦 ↔ 0 < 𝑎)) | |
| 6 | fvoveq1 7390 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → (abs‘(𝑦 − 𝐴)) = (abs‘(𝑎 − 𝐴))) | |
| 7 | fveq2 6840 | . . . . . . . 8 ⊢ (𝑦 = 𝑎 → (denom‘𝑦) = (denom‘𝑎)) | |
| 8 | 7 | oveq1d 7382 | . . . . . . 7 ⊢ (𝑦 = 𝑎 → ((denom‘𝑦)↑-2) = ((denom‘𝑎)↑-2)) |
| 9 | 6, 8 | breq12d 5098 | . . . . . 6 ⊢ (𝑦 = 𝑎 → ((abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2) ↔ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) |
| 10 | 5, 9 | anbi12d 633 | . . . . 5 ⊢ (𝑦 = 𝑎 → ((0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2)) ↔ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2)))) |
| 11 | 10 | elrab 3634 | . . . 4 ⊢ (𝑎 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} ↔ (𝑎 ∈ ℚ ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2)))) |
| 12 | 1, 4, 11 | sylanbrc 584 | . . 3 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → 𝑎 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))}) |
| 13 | simpr2 1197 | . . 3 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → (abs‘(𝑎 − 𝐴)) < 𝐵) | |
| 14 | fvoveq1 7390 | . . . . 5 ⊢ (𝑥 = 𝑎 → (abs‘(𝑥 − 𝐴)) = (abs‘(𝑎 − 𝐴))) | |
| 15 | 14 | breq1d 5095 | . . . 4 ⊢ (𝑥 = 𝑎 → ((abs‘(𝑥 − 𝐴)) < 𝐵 ↔ (abs‘(𝑎 − 𝐴)) < 𝐵)) |
| 16 | 15 | rspcev 3564 | . . 3 ⊢ ((𝑎 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} ∧ (abs‘(𝑎 − 𝐴)) < 𝐵) → ∃𝑥 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} (abs‘(𝑥 − 𝐴)) < 𝐵) |
| 17 | 12, 13, 16 | syl2anc 585 | . 2 ⊢ ((((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) ∧ 𝑎 ∈ ℚ) ∧ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) → ∃𝑥 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} (abs‘(𝑥 − 𝐴)) < 𝐵) |
| 18 | irrapxlem5 43254 | . 2 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → ∃𝑎 ∈ ℚ (0 < 𝑎 ∧ (abs‘(𝑎 − 𝐴)) < 𝐵 ∧ (abs‘(𝑎 − 𝐴)) < ((denom‘𝑎)↑-2))) | |
| 19 | 17, 18 | r19.29a 3145 | 1 ⊢ ((𝐴 ∈ ℝ+ ∧ 𝐵 ∈ ℝ+) → ∃𝑥 ∈ {𝑦 ∈ ℚ ∣ (0 < 𝑦 ∧ (abs‘(𝑦 − 𝐴)) < ((denom‘𝑦)↑-2))} (abs‘(𝑥 − 𝐴)) < 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 ∈ wcel 2114 ∃wrex 3061 {crab 3389 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 0cc0 11038 < clt 11179 − cmin 11377 -cneg 11378 2c2 12236 ℚcq 12898 ℝ+crp 12942 ↑cexp 14023 abscabs 15196 denomcdenom 16704 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-oadd 8409 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-sup 9355 df-inf 9356 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-n0 12438 df-xnn0 12511 df-z 12525 df-uz 12789 df-q 12899 df-rp 12943 df-ico 13304 df-fz 13462 df-fl 13751 df-mod 13829 df-seq 13964 df-exp 14024 df-hash 14293 df-cj 15061 df-re 15062 df-im 15063 df-sqrt 15197 df-abs 15198 df-dvds 16222 df-gcd 16464 df-numer 16705 df-denom 16706 |
| This theorem is referenced by: irrapx1 43256 |
| Copyright terms: Public domain | W3C validator |