bldisj - Intuitionistic Logic Explorer

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

Theorem bldisj 15128

Description: Two balls are disjoint if the center-to-center distance is more than the sum of the radii. (Contributed by Mario Carneiro, 30-Dec-2013.)

**Assertion**
Ref	Expression
bldisj	⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) = ∅)

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

Step	Hyp	Ref	Expression
1		simpr3 1031	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))
2		simpr1 1029	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑅 ∈ ℝ^*)
3		simpr2 1030	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑆 ∈ ℝ^*)
4	2, 3	xaddcld 10119	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑅 +_𝑒 𝑆) ∈ ℝ^*)
5		xmetcl 15079	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) → (𝑃𝐷𝑄) ∈ ℝ^*)
6	5	adantr 276	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑃𝐷𝑄) ∈ ℝ^*)
7		xrlenlt 8244	. . . . 5 ⊢ (((𝑅 +_𝑒 𝑆) ∈ ℝ^* ∧ (𝑃𝐷𝑄) ∈ ℝ^*) → ((𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄) ↔ ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
8	4, 6, 7	syl2anc 411	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄) ↔ ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
9	1, 8	mpbid 147	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆))
10		elin 3390	. . . 4 ⊢ (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)))
11		simpl1 1026	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝐷 ∈ (∞Met‘𝑋))
12		simpl2 1027	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑃 ∈ 𝑋)
13		elbl 15118	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
14	11, 12, 2, 13	syl3anc 1273	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
15		simpl3 1028	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑄 ∈ 𝑋)
16		elbl 15118	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑄 ∈ 𝑋 ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑄(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆)))
17	11, 15, 3, 16	syl3anc 1273	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑥 ∈ (𝑄(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆)))
18	14, 17	anbi12d 473	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆))))
19		anandi 594	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆)))
20	18, 19	bitr4di 198	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆))))
21	11	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝐷 ∈ (∞Met‘𝑋))
22	12	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑃 ∈ 𝑋)
23		simpr 110	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ 𝑋)
24		xmetcl 15079	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
25	21, 22, 23, 24	syl3anc 1273	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
26	15	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑄 ∈ 𝑋)
27		xmetcl 15079	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑄 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑄𝐷𝑥) ∈ ℝ^*)
28	21, 26, 23, 27	syl3anc 1273	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑄𝐷𝑥) ∈ ℝ^*)
29	2	adantr 276	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^*)
30	3	adantr 276	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑆 ∈ ℝ^*)
31		xlt2add 10115	. . . . . . . 8 ⊢ ((((𝑃𝐷𝑥) ∈ ℝ^* ∧ (𝑄𝐷𝑥) ∈ ℝ^) ∧ (𝑅 ∈ ℝ^ ∧ 𝑆 ∈ ℝ^*)) → (((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)))
32	25, 28, 29, 30, 31	syl22anc 1274	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)))
33		xmettri3 15101	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)))
34	21, 22, 26, 23, 33	syl13anc 1275	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)))
35	6	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑄) ∈ ℝ^*)
36	25, 28	xaddcld 10119	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∈ ℝ^*)
37	4	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑅 +_𝑒 𝑆) ∈ ℝ^*)
38		xrlelttr 10041	. . . . . . . . 9 ⊢ (((𝑃𝐷𝑄) ∈ ℝ^* ∧ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ∈ ℝ^*) → (((𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∧ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
39	35, 36, 37, 38	syl3anc 1273	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (((𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∧ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
40	34, 39	mpand 429	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
41	32, 40	syld 45	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
42	41	expimpd 363	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑥 ∈ 𝑋 ∧ ((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
43	20, 42	sylbid 150	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
44	10, 43	biimtrid 152	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
45	9, 44	mtod 669	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ¬ 𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)))
46	45	eq0rdv 3539	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) = ∅)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1004 = wceq 1397 ∈ wcel 2202 ∩ cin 3199 ∅c0 3494 class class class wbr 4088 ‘cfv 5326 (class class class)co 6018 ℝ^*cxr 8213 < clt 8214 ≤ cle 8215 +_𝑒 cxad 10005 ∞Metcxmet 14553 ballcbl 14555

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-13 2204 ax-14 2205 ax-ext 2213 ax-sep 4207 ax-pow 4264 ax-pr 4299 ax-un 4530 ax-setind 4635 ax-cnex 8123 ax-resscn 8124 ax-1cn 8125 ax-1re 8126 ax-icn 8127 ax-addcl 8128 ax-addrcl 8129 ax-mulcl 8130 ax-addcom 8132 ax-addass 8134 ax-i2m1 8137 ax-0id 8140 ax-rnegex 8141 ax-pre-ltirr 8144 ax-pre-ltwlin 8145 ax-pre-lttrn 8146 ax-pre-apti 8147 ax-pre-ltadd 8148

This theorem depends on definitions: df-bi 117 df-dc 842 df-3or 1005 df-3an 1006 df-tru 1400 df-fal 1403 df-nf 1509 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-ne 2403 df-nel 2498 df-ral 2515 df-rex 2516 df-rab 2519 df-v 2804 df-sbc 3032 df-csb 3128 df-dif 3202 df-un 3204 df-in 3206 df-ss 3213 df-nul 3495 df-if 3606 df-pw 3654 df-sn 3675 df-pr 3676 df-op 3678 df-uni 3894 df-iun 3972 df-br 4089 df-opab 4151 df-mpt 4152 df-id 4390 df-po 4393 df-iso 4394 df-xp 4731 df-rel 4732 df-cnv 4733 df-co 4734 df-dm 4735 df-rn 4736 df-res 4737 df-ima 4738 df-iota 5286 df-fun 5328 df-fn 5329 df-f 5330 df-fv 5334 df-ov 6021 df-oprab 6022 df-mpo 6023 df-1st 6303 df-2nd 6304 df-map 6819 df-pnf 8216 df-mnf 8217 df-xr 8218 df-ltxr 8219 df-le 8220 df-xadd 10008 df-psmet 14560 df-xmet 14561 df-bl 14563

This theorem is referenced by: bl2in 15130

W3C validator