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 23927

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 23837	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
2	1	ad4ant124 1174	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^)
3		simplrl 776	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^)
4		simplrr 777	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^)) ∧ 𝑥 ∈ 𝑋) → 𝑆 ∈ ℝ^)
5		xrltmin 13161	. . . . 5 ⊢ (((𝑃𝐷𝑥) ∈ ℝ^* ∧ 𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*) → ((𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ↔ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)))
6	2, 3, 4, 5	syl3anc 1372	. . . 4 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) ∧ 𝑥 ∈ 𝑋) → ((𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ↔ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)))
7	6	pm5.32da 580	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆))))
8		ifcl 4574	. . . 4 ⊢ ((𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^) → if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^)
9		elbl 23894	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
10	9	3expa 1119	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ if(𝑅 ≤ 𝑆, 𝑅, 𝑆) ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
11	8, 10	sylan2 594	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
12		elbl 23894	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
13	12	3expa 1119	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
14	13	adantrr 716	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
15		elbl 23894	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
16	15	3expa 1119	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
17	16	adantrl 715	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
18	14, 17	anbi12d 632	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑃(ball‘𝐷)𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆))))
19		elin 3965	. . . 4 ⊢ (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑃(ball‘𝐷)𝑆)))
20		anandi 675	. . . 4 ⊢ ((𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑆)))
21	18, 19, 20	3bitr4g 314	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑃𝐷𝑥) < 𝑆))))
22	7, 11, 21	3bitr4rd 312	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) ↔ 𝑥 ∈ (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆))))
23	22	eqrdv 2731	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^*)) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑃(ball‘𝐷)𝑆)) = (𝑃(ball‘𝐷)if(𝑅 ≤ 𝑆, 𝑅, 𝑆)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∩ cin 3948 ifcif 4529 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 ℝ^*cxr 11247 < clt 11248 ≤ cle 11249 ∞Metcxmet 20929 ballcbl 20931

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-cnex 11166 ax-resscn 11167 ax-pre-lttri 11184 ax-pre-lttrn 11185

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-id 5575 df-po 5589 df-so 5590 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-1st 7975 df-2nd 7976 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-psmet 20936 df-xmet 20937 df-bl 20939

This theorem is referenced by: blin2 23935

W3C validator