bldisj - Intuitionistic Logic Explorer

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

Theorem bldisj 15083

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 1029	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))
2		simpr1 1027	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑅 ∈ ℝ^*)
3		simpr2 1028	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑆 ∈ ℝ^*)
4	2, 3	xaddcld 10088	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑅 +_𝑒 𝑆) ∈ ℝ^*)
5		xmetcl 15034	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) → (𝑃𝐷𝑄) ∈ ℝ^*)
6	5	adantr 276	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑃𝐷𝑄) ∈ ℝ^*)
7		xrlenlt 8219	. . . . 5 ⊢ (((𝑅 +_𝑒 𝑆) ∈ ℝ^* ∧ (𝑃𝐷𝑄) ∈ ℝ^*) → ((𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄) ↔ ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
8	4, 6, 7	syl2anc 411	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄) ↔ ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
9	1, 8	mpbid 147	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ¬ (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆))
10		elin 3387	. . . 4 ⊢ (𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) ↔ (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)))
11		simpl1 1024	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝐷 ∈ (∞Met‘𝑋))
12		simpl2 1025	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑃 ∈ 𝑋)
13		elbl 15073	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑅 ∈ ℝ^*) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
14	11, 12, 2, 13	syl3anc 1271	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ↔ (𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅)))
15		simpl3 1026	. . . . . . . 8 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → 𝑄 ∈ 𝑋)
16		elbl 15073	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑄 ∈ 𝑋 ∧ 𝑆 ∈ ℝ^*) → (𝑥 ∈ (𝑄(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆)))
17	11, 15, 3, 16	syl3anc 1271	. . . . . . 7 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → (𝑥 ∈ (𝑄(ball‘𝐷)𝑆) ↔ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆)))
18	14, 17	anbi12d 473	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑥 ∈ (𝑃(ball‘𝐷)𝑅) ∧ 𝑥 ∈ (𝑄(ball‘𝐷)𝑆)) ↔ ((𝑥 ∈ 𝑋 ∧ (𝑃𝐷𝑥) < 𝑅) ∧ (𝑥 ∈ 𝑋 ∧ (𝑄𝐷𝑥) < 𝑆))))
19		anandi 592	. . . . . 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 15034	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
25	21, 22, 23, 24	syl3anc 1271	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑥) ∈ ℝ^*)
26	15	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑄 ∈ 𝑋)
27		xmetcl 15034	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑄 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) → (𝑄𝐷𝑥) ∈ ℝ^*)
28	21, 26, 23, 27	syl3anc 1271	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑄𝐷𝑥) ∈ ℝ^*)
29	2	adantr 276	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑅 ∈ ℝ^*)
30	3	adantr 276	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → 𝑆 ∈ ℝ^*)
31		xlt2add 10084	. . . . . . . 8 ⊢ ((((𝑃𝐷𝑥) ∈ ℝ^* ∧ (𝑄𝐷𝑥) ∈ ℝ^) ∧ (𝑅 ∈ ℝ^ ∧ 𝑆 ∈ ℝ^*)) → (((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)))
32	25, 28, 29, 30, 31	syl22anc 1272	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (((𝑃𝐷𝑥) < 𝑅 ∧ (𝑄𝐷𝑥) < 𝑆) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)))
33		xmettri3 15056	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ (𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)))
34	21, 22, 26, 23, 33	syl13anc 1273	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)))
35	6	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑃𝐷𝑄) ∈ ℝ^*)
36	25, 28	xaddcld 10088	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∈ ℝ^*)
37	4	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) ∧ 𝑥 ∈ 𝑋) → (𝑅 +_𝑒 𝑆) ∈ ℝ^*)
38		xrlelttr 10010	. . . . . . . . 9 ⊢ (((𝑃𝐷𝑄) ∈ ℝ^* ∧ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ∈ ℝ^*) → (((𝑃𝐷𝑄) ≤ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) ∧ ((𝑃𝐷𝑥) +_𝑒 (𝑄𝐷𝑥)) < (𝑅 +_𝑒 𝑆)) → (𝑃𝐷𝑄) < (𝑅 +_𝑒 𝑆)))
39	35, 36, 37, 38	syl3anc 1271	. . . . . . . 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 667	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ¬ 𝑥 ∈ ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)))
46	45	eq0rdv 3536	1 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑃 ∈ 𝑋 ∧ 𝑄 ∈ 𝑋) ∧ (𝑅 ∈ ℝ^* ∧ 𝑆 ∈ ℝ^* ∧ (𝑅 +_𝑒 𝑆) ≤ (𝑃𝐷𝑄))) → ((𝑃(ball‘𝐷)𝑅) ∩ (𝑄(ball‘𝐷)𝑆)) = ∅)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∩ cin 3196 ∅c0 3491 class class class wbr 4083 ‘cfv 5318 (class class class)co 6007 ℝ^*cxr 8188 < clt 8189 ≤ cle 8190 +_𝑒 cxad 9974 ∞Metcxmet 14508 ballcbl 14510

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8098 ax-resscn 8099 ax-1cn 8100 ax-1re 8101 ax-icn 8102 ax-addcl 8103 ax-addrcl 8104 ax-mulcl 8105 ax-addcom 8107 ax-addass 8109 ax-i2m1 8112 ax-0id 8115 ax-rnegex 8116 ax-pre-ltirr 8119 ax-pre-ltwlin 8120 ax-pre-lttrn 8121 ax-pre-apti 8122 ax-pre-ltadd 8123

This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-po 4387 df-iso 4388 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-map 6805 df-pnf 8191 df-mnf 8192 df-xr 8193 df-ltxr 8194 df-le 8195 df-xadd 9977 df-psmet 14515 df-xmet 14516 df-bl 14518

This theorem is referenced by: bl2in 15085

W3C validator