Theorem prdsbl 24718

Description: A ball in the product metric for finite index set is the Cartesian product of balls in all coordinates. For infinite index set this is no longer true; instead the correct statement is that a *closed ball* is the product of closed balls in each coordinate (where closed ball means a set of the form in blcld 24732) - for a counterexample the point 𝑝 in ℝ↑ℕ whose 𝑛-th coordinate is 1 − 1 / 𝑛 is in X𝑛 ∈ ℕball(0, 1) but is not in the 1-ball of the product (since 𝑑(0, 𝑝) = 1).

The last assumption, 0 < 𝐴, is needed only in the case 𝐼 = ∅, when the right side evaluates to {∅} and the left evaluates to ∅ if 𝐴 ≤ 0 and {∅} if 0 < 𝐴. (Contributed by Mario Carneiro, 28-Aug-2015.)

Hypotheses

Ref	Expression
prdsbl.y	⊢ 𝑌 = (𝑆Xs(𝑥 ∈ 𝐼 ↦ 𝑅))
prdsbl.b	⊢ 𝐵 = (Base‘𝑌)
prdsbl.v	⊢ 𝑉 = (Base‘𝑅)
prdsbl.e	⊢ 𝐸 = ((dist‘𝑅) ↾ (𝑉 × 𝑉))
prdsbl.d	⊢ 𝐷 = (dist‘𝑌)
prdsbl.s	⊢ (𝜑 → 𝑆 ∈ 𝑊)
prdsbl.i	⊢ (𝜑 → 𝐼 ∈ Fin)
prdsbl.r	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ 𝑍)
prdsbl.m	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
prdsbl.p	⊢ (𝜑 → 𝑃 ∈ 𝐵)
prdsbl.a	⊢ (𝜑 → 𝐴 ∈ ℝ*)
prdsbl.g	⊢ (𝜑 → 0 < 𝐴)

Assertion

Ref	Expression
prdsbl	⊢ (𝜑 → (𝑃(ball‘𝐷)𝐴) = X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝐼   𝑥,𝑃   𝜑,𝑥

Allowed substitution hints:   𝑅(𝑥)   𝑆(𝑥)   𝐸(𝑥)   𝑉(𝑥)   𝑊(𝑥)   𝑌(𝑥)   𝑍(𝑥)

Proof of Theorem prdsbl

Dummy variables 𝑓 𝑧 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		prdsbl.y	. . . . . . . . 9 ⊢ 𝑌 = (𝑆Xs(𝑥 ∈ 𝐼 ↦ 𝑅))
2		prdsbl.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑌)
3		prdsbl.s	. . . . . . . . 9 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
4		prdsbl.i	. . . . . . . . 9 ⊢ (𝜑 → 𝐼 ∈ Fin)
5		prdsbl.r	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝑅 ∈ 𝑍)
6	5	ralrimiva 3154	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
7		prdsbl.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑅)
8	1, 2, 3, 4, 6, 7	prdsbas3 17567	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 𝑉)
9	8	eleq2d 2846	. . . . . . 7 ⊢ (𝜑 → (𝑓 ∈ 𝐵 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉))
10	9	biimpa 482	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉)
11		ixpfn 8911	. . . . . 6 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 𝑉 → 𝑓 Fn 𝐼)
12		vex 3454	. . . . . . . 8 ⊢ 𝑓 ∈ V
13	12	elixp 8912	. . . . . . 7 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
14	13	baib 545	. . . . . 6 ⊢ (𝑓 Fn 𝐼 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
15	10, 11, 14	3syl 19	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
16		prdsbl.m	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
17	16	adantlr 728	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
18		prdsbl.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
19	18	ad2antrr 739	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
20		prdsbl.p	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ 𝐵)
21	1, 2, 3, 4, 6, 7, 20	prdsbascl 17569	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
22	21	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
23	22	r19.21bi 3254	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
24	3	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑆 ∈ 𝑊)
25	4	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝐼 ∈ Fin)
26	6	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
27		simpr 490	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ 𝐵)
28	1, 2, 24, 25, 26, 7, 27	prdsbascl 17569	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
29	28	r19.21bi 3254	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
30		elbl2 24617	. . . . . . 7 ⊢ (((𝐸 ∈ (∞Met‘𝑉) ∧ 𝐴 ∈ ℝ*) ∧ ((𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉)) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
31	17, 19, 23, 29, 30	syl22anc 852	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
32	31	ralbidva 3183	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
33		xmetcl 24558	. . . . . . . . . 10 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
34	17, 23, 29, 33	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
35	34	ralrimiva 3154	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
36		eqid 2760	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))
37		breq1 5106	. . . . . . . . 9 ⊢ (𝑧 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) → (𝑧 < 𝐴 ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
38	36, 37	ralrnmptw 7088	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
39	35, 38	syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
40		prdsbl.g	. . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴)
41	40	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 < 𝐴)
42		c0ex 11225	. . . . . . . . . 10 ⊢ 0 ∈ V
43		breq1 5106	. . . . . . . . . 10 ⊢ (𝑧 = 0 → (𝑧 < 𝐴 ↔ 0 < 𝐴))
44	42, 43	ralsn 4642	. . . . . . . . 9 ⊢ (∀𝑧 ∈ {0}𝑧 < 𝐴 ↔ 0 < 𝐴)
45	41, 44	sylibr 237	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑧 ∈ {0}𝑧 < 𝐴)
46		ralunb 4143	. . . . . . . . 9 ⊢ (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 ↔ (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴))
47	20	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑃 ∈ 𝐵)
48		prdsbl.e	. . . . . . . . . . . 12 ⊢ 𝐸 = ((dist‘𝑅) ↾ (𝑉 × 𝑉))
49		prdsbl.d	. . . . . . . . . . . 12 ⊢ 𝐷 = (dist‘𝑌)
50	1, 2, 24, 25, 26, 47, 27, 7, 48, 49	prdsdsval3 17571	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
51		xrltso 13193	. . . . . . . . . . . . 13 ⊢ < Or ℝ*
52	51	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → < Or ℝ*)
53	36	rnmpt 5941	. . . . . . . . . . . . . . 15 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))}
54		abrexfi 9320	. . . . . . . . . . . . . . 15 ⊢ (𝐼 ∈ Fin → {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))} ∈ Fin)
55	53, 54	eqeltrid 2864	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ Fin → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
56	25, 55	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
57		snfi 9051	. . . . . . . . . . . . 13 ⊢ {0} ∈ Fin
58		unfi 9166	. . . . . . . . . . . . 13 ⊢ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin ∧ {0} ∈ Fin) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
59	56, 57, 58	sylancl 598	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
60		ssun2 4125	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
61	42	snss 4745	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ↔ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
62	60, 61	mpbir 234	. . . . . . . . . . . . 13 ⊢ 0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
63		ne0i 4287	. . . . . . . . . . . . 13 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
64	62, 63	mp1i 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
65	34	fmpttd 7109	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))):𝐼⟶ℝ*)
66	65	frnd 6712	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ ℝ*)
67		0xr 11281	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℝ*
68	67	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 ∈ ℝ*)
69	68	snssd 4747	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → {0} ⊆ ℝ*)
70	66, 69	unssd 4138	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)
71		fisupcl 9441	. . . . . . . . . . . 12 ⊢ (( < Or ℝ* ∧ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅ ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
72	52, 59, 64, 70, 71	syl13anc 1399	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
73	50, 72	eqeltrd 2860	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
74		breq1 5106	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑃𝐷𝑓) → (𝑧 < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
75	74	rspcv 3572	. . . . . . . . . 10 ⊢ ((𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
76	73, 75	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
77	46, 76	biimtrrid 246	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴) → (𝑃𝐷𝑓) < 𝐴))
78	45, 77	mpan2d 707	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
79	39, 78	sylbird 263	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
80		ssun1 4124	. . . . . . . . . . 11 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
81		ovex 7447	. . . . . . . . . . . . . 14 ⊢ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ V
82	81	elabrex 7240	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐼 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
83	82	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
84	83, 53	eleqtrrdi 2871	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))))
85	80, 84	sselid 3929	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
86		supxrub 13377	. . . . . . . . . 10 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ* ∧ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
87	70, 85, 86	syl2an2r 698	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
88	50	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
89	87, 88	breqtrrd 5133	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓))
90	1, 2, 7, 48, 49, 3, 4, 5, 16	prdsxmet 24596	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝐵))
91	90	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐷 ∈ (∞Met‘𝐵))
92	20	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ 𝐵)
93	27	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑓 ∈ 𝐵)
94		xmetcl 24558	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ ℝ*)
95	91, 92, 93, 94	syl3anc 1398	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) ∈ ℝ*)
96		xrlelttr 13208	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* ∧ (𝑃𝐷𝑓) ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
97	34, 95, 19, 96	syl3anc 1398	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
98	89, 97	mpand 708	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃𝐷𝑓) < 𝐴 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
99	98	ralrimdva 3162	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
100	79, 99	impbid 215	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
101	15, 32, 100	3bitrrd 309	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
102	101	pm5.32da 590	. . 3 ⊢ (𝜑 → ((𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
103		elbl 24615	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝐴 ∈ ℝ*) → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
104	90, 20, 18, 103	syl3anc 1398	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
105	21	r19.21bi 3254	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
106	18	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
107		blssm 24645	. . . . . . . . 9 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ 𝐴 ∈ ℝ*) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
108	16, 105, 106, 107	syl3anc 1398	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
109	108	ralrimiva 3154	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
110		ss2ixp 8918	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
111	109, 110	syl 18	. . . . . 6 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
112	111, 8	sseqtrrd 3968	. . . . 5 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝐵)
113	112	sseld 3930	. . . 4 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) → 𝑓 ∈ 𝐵))
114	113	pm4.71rd 572	. . 3 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
115	102, 104, 114	3bitr4d 314	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
116	115	eqrdv 2758	1 ⊢ (𝜑 → (𝑃(ball‘𝐷)𝐴) = X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2738   ≠ wne 2955  ∀wral 3076  ∃wrex 3086   ∪ cun 3897   ⊆ wss 3899  ∅c0 4279  {csn 4584   class class class wbr 5103   ↦ cmpt 5186   Or wor 5562   × cxp 5653  ran crn 5656   ↾ cres 5657   Fn wfn 6528  ‘cfv 6533  (class class class)co 7414  Xcixp 8905  Fincfn 8953  supcsup 9411  0cc0 11125  ℝ^*cxr 11267   < clt 11268   ≤ cle 11269  Basecbs 17302  distcds 17352  X_scprds 17531  ∞Metcxmet 21571  ballcbl 21573

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7737  ax-cnex 11181  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201  ax-pre-mulgt0 11202  ax-pre-sup 11203

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7371  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8281  df-wrecs 8312  df-recs 8361  df-rdg 8400  df-1o 8456  df-er 8697  df-map 8829  df-ixp 8906  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957  df-sup 9413  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-div 11897  df-nn 12259  df-2 12328  df-3 12329  df-4 12330  df-5 12331  df-6 12332  df-7 12333  df-8 12334  df-9 12335  df-n0 12530  df-z 12617  df-dec 12738  df-uz 12889  df-rp 13044  df-xneg 13164  df-xadd 13165  df-xmul 13166  df-icc 13406  df-fz 13563  df-struct 17240  df-slot 17275  df-ndx 17287  df-base 17303  df-plusg 17356  df-mulr 17357  df-sca 17359  df-vsca 17360  df-ip 17361  df-tset 17362  df-ple 17363  df-ds 17365  df-hom 17367  df-cco 17368  df-prds 17533  df-psmet 21578  df-xmet 21579  df-bl 21581

This theorem is used by:  prdsxmslem2  24756  prdstotbnd  38545  prdsbnd2  38546