Theorem prdsbl 23098

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 23112) - 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 3149	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
7		prdsbl.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑅)
8	1, 2, 3, 4, 6, 7	prdsbas3 16746	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 𝑉)
9	8	eleq2d 2875	. . . . . . 7 ⊢ (𝜑 → (𝑓 ∈ 𝐵 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉))
10	9	biimpa 480	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉)
11		ixpfn 8450	. . . . . 6 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 𝑉 → 𝑓 Fn 𝐼)
12		vex 3444	. . . . . . . 8 ⊢ 𝑓 ∈ V
13	12	elixp 8451	. . . . . . 7 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
14	13	baib 539	. . . . . 6 ⊢ (𝑓 Fn 𝐼 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
15	10, 11, 14	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
16		prdsbl.m	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
17	16	adantlr 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
18		prdsbl.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
19	18	ad2antrr 725	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
20		prdsbl.p	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ 𝐵)
21	1, 2, 3, 4, 6, 7, 20	prdsbascl 16748	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
22	21	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
23	22	r19.21bi 3173	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
24	3	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑆 ∈ 𝑊)
25	4	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝐼 ∈ Fin)
26	6	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
27		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ 𝐵)
28	1, 2, 24, 25, 26, 7, 27	prdsbascl 16748	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
29	28	r19.21bi 3173	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
30		elbl2 22997	. . . . . . 7 ⊢ (((𝐸 ∈ (∞Met‘𝑉) ∧ 𝐴 ∈ ℝ*) ∧ ((𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉)) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
31	17, 19, 23, 29, 30	syl22anc 837	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
32	31	ralbidva 3161	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
33		xmetcl 22938	. . . . . . . . . 10 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
34	17, 23, 29, 33	syl3anc 1368	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
35	34	ralrimiva 3149	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
36		eqid 2798	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))
37		breq1 5033	. . . . . . . . 9 ⊢ (𝑧 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) → (𝑧 < 𝐴 ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
38	36, 37	ralrnmptw 6837	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
39	35, 38	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
40		prdsbl.g	. . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴)
41	40	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 < 𝐴)
42		c0ex 10624	. . . . . . . . . 10 ⊢ 0 ∈ V
43		breq1 5033	. . . . . . . . . 10 ⊢ (𝑧 = 0 → (𝑧 < 𝐴 ↔ 0 < 𝐴))
44	42, 43	ralsn 4579	. . . . . . . . 9 ⊢ (∀𝑧 ∈ {0}𝑧 < 𝐴 ↔ 0 < 𝐴)
45	41, 44	sylibr 237	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑧 ∈ {0}𝑧 < 𝐴)
46		ralunb 4118	. . . . . . . . 9 ⊢ (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 ↔ (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴))
47	20	adantr 484	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑃 ∈ 𝐵)
48		prdsbl.e	. . . . . . . . . . . 12 ⊢ 𝐸 = ((dist‘𝑅) ↾ (𝑉 × 𝑉))
49		prdsbl.d	. . . . . . . . . . . 12 ⊢ 𝐷 = (dist‘𝑌)
50	1, 2, 24, 25, 26, 47, 27, 7, 48, 49	prdsdsval3 16750	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
51		xrltso 12522	. . . . . . . . . . . . 13 ⊢ < Or ℝ*
52	51	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → < Or ℝ*)
53	36	rnmpt 5791	. . . . . . . . . . . . . . 15 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))}
54		abrexfi 8808	. . . . . . . . . . . . . . 15 ⊢ (𝐼 ∈ Fin → {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))} ∈ Fin)
55	53, 54	eqeltrid 2894	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ Fin → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
56	25, 55	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
57		snfi 8577	. . . . . . . . . . . . 13 ⊢ {0} ∈ Fin
58		unfi 8769	. . . . . . . . . . . . 13 ⊢ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin ∧ {0} ∈ Fin) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
59	56, 57, 58	sylancl 589	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
60		ssun2 4100	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
61	42	snss 4679	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ↔ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
62	60, 61	mpbir 234	. . . . . . . . . . . . 13 ⊢ 0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
63		ne0i 4250	. . . . . . . . . . . . 13 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
64	62, 63	mp1i 13	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
65	34	fmpttd 6856	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))):𝐼⟶ℝ*)
66	65	frnd 6494	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ ℝ*)
67		0xr 10677	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℝ*
68	67	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 ∈ ℝ*)
69	68	snssd 4702	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → {0} ⊆ ℝ*)
70	66, 69	unssd 4113	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)
71		fisupcl 8917	. . . . . . . . . . . 12 ⊢ (( < Or ℝ* ∧ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅ ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
72	52, 59, 64, 70, 71	syl13anc 1369	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
73	50, 72	eqeltrd 2890	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
74		breq1 5033	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑃𝐷𝑓) → (𝑧 < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
75	74	rspcv 3566	. . . . . . . . . 10 ⊢ ((𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
76	73, 75	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
77	46, 76	syl5bir 246	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴) → (𝑃𝐷𝑓) < 𝐴))
78	45, 77	mpan2d 693	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
79	39, 78	sylbird 263	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
80		ssun1 4099	. . . . . . . . . . 11 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
81		ovex 7168	. . . . . . . . . . . . . 14 ⊢ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ V
82	81	elabrex 6980	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐼 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
83	82	adantl 485	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
84	83, 53	eleqtrrdi 2901	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))))
85	80, 84	sseldi 3913	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
86		supxrub 12705	. . . . . . . . . 10 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ* ∧ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
87	70, 85, 86	syl2an2r 684	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
88	50	adantr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
89	87, 88	breqtrrd 5058	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓))
90	1, 2, 7, 48, 49, 3, 4, 5, 16	prdsxmet 22976	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝐵))
91	90	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐷 ∈ (∞Met‘𝐵))
92	20	ad2antrr 725	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ 𝐵)
93	27	adantr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑓 ∈ 𝐵)
94		xmetcl 22938	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ ℝ*)
95	91, 92, 93, 94	syl3anc 1368	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) ∈ ℝ*)
96		xrlelttr 12537	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* ∧ (𝑃𝐷𝑓) ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
97	34, 95, 19, 96	syl3anc 1368	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
98	89, 97	mpand 694	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃𝐷𝑓) < 𝐴 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
99	98	ralrimdva 3154	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
100	79, 99	impbid 215	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
101	15, 32, 100	3bitrrd 309	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
102	101	pm5.32da 582	. . 3 ⊢ (𝜑 → ((𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
103		elbl 22995	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝐴 ∈ ℝ*) → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
104	90, 20, 18, 103	syl3anc 1368	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
105	21	r19.21bi 3173	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
106	18	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
107		blssm 23025	. . . . . . . . 9 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ 𝐴 ∈ ℝ*) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
108	16, 105, 106, 107	syl3anc 1368	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
109	108	ralrimiva 3149	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
110		ss2ixp 8457	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
111	109, 110	syl 17	. . . . . 6 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
112	111, 8	sseqtrrd 3956	. . . . 5 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝐵)
113	112	sseld 3914	. . . 4 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) → 𝑓 ∈ 𝐵))
114	113	pm4.71rd 566	. . 3 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
115	102, 104, 114	3bitr4d 314	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
116	115	eqrdv 2796	1 ⊢ (𝜑 → (𝑃(ball‘𝐷)𝐴) = X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  {cab 2776   ≠ wne 2987  ∀wral 3106  ∃wrex 3107   ∪ cun 3879   ⊆ wss 3881  ∅c0 4243  {csn 4525   class class class wbr 5030   ↦ cmpt 5110   Or wor 5437   × cxp 5517  ran crn 5520   ↾ cres 5521   Fn wfn 6319  ‘cfv 6324  (class class class)co 7135  Xcixp 8444  Fincfn 8492  supcsup 8888  0cc0 10526  ℝ^*cxr 10663   < clt 10664   ≤ cle 10665  Basecbs 16475  distcds 16566  X_scprds 16711  ∞Metcxmet 20076  ballcbl 20078

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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-rep 5154  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441  ax-cnex 10582  ax-resscn 10583  ax-1cn 10584  ax-icn 10585  ax-addcl 10586  ax-addrcl 10587  ax-mulcl 10588  ax-mulrcl 10589  ax-mulcom 10590  ax-addass 10591  ax-mulass 10592  ax-distr 10593  ax-i2m1 10594  ax-1ne0 10595  ax-1rid 10596  ax-rnegex 10597  ax-rrecex 10598  ax-cnre 10599  ax-pre-lttri 10600  ax-pre-lttrn 10601  ax-pre-ltadd 10602  ax-pre-mulgt0 10603  ax-pre-sup 10604

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-reu 3113  df-rmo 3114  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-tp 4530  df-op 4532  df-uni 4801  df-int 4839  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-tr 5137  df-id 5425  df-eprel 5430  df-po 5438  df-so 5439  df-fr 5478  df-we 5480  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-res 5531  df-ima 5532  df-pred 6116  df-ord 6162  df-on 6163  df-lim 6164  df-suc 6165  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-riota 7093  df-ov 7138  df-oprab 7139  df-mpo 7140  df-om 7561  df-1st 7671  df-2nd 7672  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-1o 8085  df-oadd 8089  df-er 8272  df-map 8391  df-ixp 8445  df-en 8493  df-dom 8494  df-sdom 8495  df-fin 8496  df-sup 8890  df-pnf 10666  df-mnf 10667  df-xr 10668  df-ltxr 10669  df-le 10670  df-sub 10861  df-neg 10862  df-div 11287  df-nn 11626  df-2 11688  df-3 11689  df-4 11690  df-5 11691  df-6 11692  df-7 11693  df-8 11694  df-9 11695  df-n0 11886  df-z 11970  df-dec 12087  df-uz 12232  df-rp 12378  df-xneg 12495  df-xadd 12496  df-xmul 12497  df-icc 12733  df-fz 12886  df-struct 16477  df-ndx 16478  df-slot 16479  df-base 16481  df-plusg 16570  df-mulr 16571  df-sca 16573  df-vsca 16574  df-ip 16575  df-tset 16576  df-ple 16577  df-ds 16579  df-hom 16581  df-cco 16582  df-prds 16713  df-psmet 20083  df-xmet 20084  df-bl 20086

This theorem is referenced by:  prdsxmslem2  23136  prdstotbnd  35232  prdsbnd2  35233