ssblex - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > ssblex		GIF version

Theorem ssblex 12639

Description: A nested ball exists whose radius is less than any desired amount. (Contributed by NM, 20-Sep-2007.) (Revised by Mario Carneiro, 12-Nov-2013.)

**Assertion**
Ref	Expression
ssblex	⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → ∃𝑥 ∈ ℝ⁺ (𝑥 < 𝑅 ∧ (𝑃(ball‘𝐷)𝑥) ⊆ (𝑃(ball‘𝐷)𝑆)))

Distinct variable groups: 𝑥,𝐷 𝑥,𝑅 𝑥,𝑃 𝑥,𝑆 𝑥,𝑋

**Proof of Theorem ssblex**
Step	Hyp	Ref	Expression
1		simprl 521	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 𝑅 ∈ ℝ⁺)
2	1	rphalfcld 9526	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (𝑅 / 2) ∈ ℝ⁺)
3		simprr 522	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 𝑆 ∈ ℝ⁺)
4		rpmincl 11041	. . 3 ⊢ (((𝑅 / 2) ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ⁺)
5	2, 3, 4	syl2anc 409	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ⁺)
6	5	rpred 9513	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ)
7	2	rpred 9513	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (𝑅 / 2) ∈ ℝ)
8	1	rpred 9513	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 𝑅 ∈ ℝ)
9	3	rpred 9513	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 𝑆 ∈ ℝ)
10		min1inf 11035	. . . 4 ⊢ (((𝑅 / 2) ∈ ℝ ∧ 𝑆 ∈ ℝ) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ≤ (𝑅 / 2))
11	7, 9, 10	syl2anc 409	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ≤ (𝑅 / 2))
12	1	rpgt0d 9516	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 0 < 𝑅)
13		halfpos 8975	. . . . 5 ⊢ (𝑅 ∈ ℝ → (0 < 𝑅 ↔ (𝑅 / 2) < 𝑅))
14	8, 13	syl 14	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (0 < 𝑅 ↔ (𝑅 / 2) < 𝑅))
15	12, 14	mpbid 146	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (𝑅 / 2) < 𝑅)
16	6, 7, 8, 11, 15	lelttrd 7911	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) < 𝑅)
17		simpl 108	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋))
18	5	rpxrd 9514	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ^*)
19	3	rpxrd 9514	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → 𝑆 ∈ ℝ^*)
20		min2inf 11036	. . . 4 ⊢ (((𝑅 / 2) ∈ ℝ ∧ 𝑆 ∈ ℝ) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ≤ 𝑆)
21	7, 9, 20	syl2anc 409	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → inf({(𝑅 / 2), 𝑆}, ℝ, < ) ≤ 𝑆)
22		ssbl 12634	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*) ∧ inf({(𝑅 / 2), 𝑆}, ℝ, < ) ≤ 𝑆) → (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )) ⊆ (𝑃(ball‘𝐷)𝑆))
23	17, 18, 19, 21, 22	syl121anc 1222	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )) ⊆ (𝑃(ball‘𝐷)𝑆))
24		breq1 3940	. . . 4 ⊢ (𝑥 = inf({(𝑅 / 2), 𝑆}, ℝ, < ) → (𝑥 < 𝑅 ↔ inf({(𝑅 / 2), 𝑆}, ℝ, < ) < 𝑅))
25		oveq2 5790	. . . . 5 ⊢ (𝑥 = inf({(𝑅 / 2), 𝑆}, ℝ, < ) → (𝑃(ball‘𝐷)𝑥) = (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )))
26	25	sseq1d 3131	. . . 4 ⊢ (𝑥 = inf({(𝑅 / 2), 𝑆}, ℝ, < ) → ((𝑃(ball‘𝐷)𝑥) ⊆ (𝑃(ball‘𝐷)𝑆) ↔ (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )) ⊆ (𝑃(ball‘𝐷)𝑆)))
27	24, 26	anbi12d 465	. . 3 ⊢ (𝑥 = inf({(𝑅 / 2), 𝑆}, ℝ, < ) → ((𝑥 < 𝑅 ∧ (𝑃(ball‘𝐷)𝑥) ⊆ (𝑃(ball‘𝐷)𝑆)) ↔ (inf({(𝑅 / 2), 𝑆}, ℝ, < ) < 𝑅 ∧ (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )) ⊆ (𝑃(ball‘𝐷)𝑆))))
28	27	rspcev 2793	. 2 ⊢ ((inf({(𝑅 / 2), 𝑆}, ℝ, < ) ∈ ℝ⁺ ∧ (inf({(𝑅 / 2), 𝑆}, ℝ, < ) < 𝑅 ∧ (𝑃(ball‘𝐷)inf({(𝑅 / 2), 𝑆}, ℝ, < )) ⊆ (𝑃(ball‘𝐷)𝑆))) → ∃𝑥 ∈ ℝ⁺ (𝑥 < 𝑅 ∧ (𝑃(ball‘𝐷)𝑥) ⊆ (𝑃(ball‘𝐷)𝑆)))
29	5, 16, 23, 28	syl12anc 1215	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ⁺ ∧ 𝑆 ∈ ℝ⁺)) → ∃𝑥 ∈ ℝ⁺ (𝑥 < 𝑅 ∧ (𝑃(ball‘𝐷)𝑥) ⊆ (𝑃(ball‘𝐷)𝑆)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1332 ∈ wcel 1481 ∃wrex 2418 ⊆ wss 3076 {cpr 3533 class class class wbr 3937 ‘cfv 5131 (class class class)co 5782 infcinf 6878 ℝcr 7643 0cc0 7644 ℝ^*cxr 7823 < clt 7824 ≤ cle 7825 / cdiv 8456 2c2 8795 ℝ⁺crp 9470 ∞Metcxmet 12188 ballcbl 12190

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-13 1492 ax-14 1493 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 ax-coll 4051 ax-sep 4054 ax-nul 4062 ax-pow 4106 ax-pr 4139 ax-un 4363 ax-setind 4460 ax-iinf 4510 ax-cnex 7735 ax-resscn 7736 ax-1cn 7737 ax-1re 7738 ax-icn 7739 ax-addcl 7740 ax-addrcl 7741 ax-mulcl 7742 ax-mulrcl 7743 ax-addcom 7744 ax-mulcom 7745 ax-addass 7746 ax-mulass 7747 ax-distr 7748 ax-i2m1 7749 ax-0lt1 7750 ax-1rid 7751 ax-0id 7752 ax-rnegex 7753 ax-precex 7754 ax-cnre 7755 ax-pre-ltirr 7756 ax-pre-ltwlin 7757 ax-pre-lttrn 7758 ax-pre-apti 7759 ax-pre-ltadd 7760 ax-pre-mulgt0 7761 ax-pre-mulext 7762 ax-arch 7763 ax-caucvg 7764

This theorem depends on definitions: df-bi 116 df-stab 817 df-dc 821 df-3or 964 df-3an 965 df-tru 1335 df-fal 1338 df-nf 1438 df-sb 1737 df-eu 2003 df-mo 2004 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-ne 2310 df-nel 2405 df-ral 2422 df-rex 2423 df-reu 2424 df-rmo 2425 df-rab 2426 df-v 2691 df-sbc 2914 df-csb 3008 df-dif 3078 df-un 3080 df-in 3082 df-ss 3089 df-nul 3369 df-if 3480 df-pw 3517 df-sn 3538 df-pr 3539 df-op 3541 df-uni 3745 df-int 3780 df-iun 3823 df-br 3938 df-opab 3998 df-mpt 3999 df-tr 4035 df-id 4223 df-po 4226 df-iso 4227 df-iord 4296 df-on 4298 df-ilim 4299 df-suc 4301 df-iom 4513 df-xp 4553 df-rel 4554 df-cnv 4555 df-co 4556 df-dm 4557 df-rn 4558 df-res 4559 df-ima 4560 df-iota 5096 df-fun 5133 df-fn 5134 df-f 5135 df-f1 5136 df-fo 5137 df-f1o 5138 df-fv 5139 df-isom 5140 df-riota 5738 df-ov 5785 df-oprab 5786 df-mpo 5787 df-1st 6046 df-2nd 6047 df-recs 6210 df-frec 6296 df-map 6552 df-sup 6879 df-inf 6880 df-pnf 7826 df-mnf 7827 df-xr 7828 df-ltxr 7829 df-le 7830 df-sub 7959 df-neg 7960 df-reap 8361 df-ap 8368 df-div 8457 df-inn 8745 df-2 8803 df-3 8804 df-4 8805 df-n0 9002 df-z 9079 df-uz 9351 df-rp 9471 df-xneg 9589 df-xadd 9590 df-seqfrec 10250 df-exp 10324 df-cj 10646 df-re 10647 df-im 10648 df-rsqrt 10802 df-abs 10803 df-psmet 12195 df-xmet 12196 df-bl 12198

This theorem is referenced by: mopni3 12692

W3C validator