blin - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > blin		Structured version Visualization version GIF version

Theorem blin 23918

Description: The intersection of two balls with the same center is the smaller of them. (Contributed by NM, 1-Sep-2006.) (Revised by Mario Carneiro, 12-Nov-2013.)

**Assertion**
Ref	Expression
blin	⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) = (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)))

Proof of Theorem blin Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		xmetcl 23828	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
2	1	ad4ant124 1173	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^)
3		simplrl 775	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^)
4		simplrr 776	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → 𝑆 ∈ ℝ^)
5		xrltmin 13157	. . . . 5 ⊢ (((𝑃𝐷𝑥) ∈ ℝ^* ∧ 𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*) → ((𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ↔ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)))
6	2, 3, 4, 5	syl3anc 1371	. . . 4 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) ∧ 𝑥 ∈ 𝑋) → ((𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ↔ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)))
7	6	pm5.32da 579	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆))))
8		ifcl 4572	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^) → if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^)
9		elbl 23885	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
10	9	3expa 1118	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
11	8, 10	sylan2 593	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
12		elbl 23885	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
13	12	3expa 1118	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
14	13	adantrr 715	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
15		elbl 23885	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
16	15	3expa 1118	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
17	16	adantrl 714	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
18	14, 17	anbi12d 631	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑃(ball‘𝐷)𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆))))
19		elin 3963	. . . 4 ⊢ (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑃(ball‘𝐷)𝑆)))
20		anandi 674	. . . 4 ⊢ ((𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
21	18, 19, 20	3bitr4g 313	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆))))
22	7, 11, 21	3bitr4rd 311	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ 𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
23	22	eqrdv 2730	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) = (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∩ cin 3946 ifcif 4527 class class class wbr 5147 ‘cfv 6540 (class class class)co 7405 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 ∞Metcxmet 20921 ballcbl 20923

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-cnex 11162 ax-resscn 11163 ax-pre-lttri 11180 ax-pre-lttrn 11181

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-po 5587 df-so 5588 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7408 df-oprab 7409 df-mpo 7410 df-1st 7971 df-2nd 7972 df-er 8699 df-map 8818 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-psmet 20928 df-xmet 20929 df-bl 20931

This theorem is referenced by: blin2 23926

W3C validator