Theorem prdsbl 23553

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 23567) - 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 3107	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
7		prdsbl.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑅)
8	1, 2, 3, 4, 6, 7	prdsbas3 17109	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 𝑉)
9	8	eleq2d 2824	. . . . . . 7 ⊢ (𝜑 → (𝑓 ∈ 𝐵 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉))
10	9	biimpa 476	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉)
11		ixpfn 8649	. . . . . 6 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 𝑉 → 𝑓 Fn 𝐼)
12		vex 3426	. . . . . . . 8 ⊢ 𝑓 ∈ V
13	12	elixp 8650	. . . . . . 7 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
14	13	baib 535	. . . . . 6 ⊢ (𝑓 Fn 𝐼 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
15	10, 11, 14	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
16		prdsbl.m	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
17	16	adantlr 711	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
18		prdsbl.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
19	18	ad2antrr 722	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
20		prdsbl.p	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ 𝐵)
21	1, 2, 3, 4, 6, 7, 20	prdsbascl 17111	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
22	21	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
23	22	r19.21bi 3132	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
24	3	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑆 ∈ 𝑊)
25	4	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝐼 ∈ Fin)
26	6	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
27		simpr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ 𝐵)
28	1, 2, 24, 25, 26, 7, 27	prdsbascl 17111	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
29	28	r19.21bi 3132	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
30		elbl2 23451	. . . . . . 7 ⊢ (((𝐸 ∈ (∞Met‘𝑉) ∧ 𝐴 ∈ ℝ*) ∧ ((𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉)) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
31	17, 19, 23, 29, 30	syl22anc 835	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
32	31	ralbidva 3119	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
33		xmetcl 23392	. . . . . . . . . 10 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
34	17, 23, 29, 33	syl3anc 1369	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
35	34	ralrimiva 3107	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
36		eqid 2738	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))
37		breq1 5073	. . . . . . . . 9 ⊢ (𝑧 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) → (𝑧 < 𝐴 ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
38	36, 37	ralrnmptw 6952	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
39	35, 38	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
40		prdsbl.g	. . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴)
41	40	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 < 𝐴)
42		c0ex 10900	. . . . . . . . . 10 ⊢ 0 ∈ V
43		breq1 5073	. . . . . . . . . 10 ⊢ (𝑧 = 0 → (𝑧 < 𝐴 ↔ 0 < 𝐴))
44	42, 43	ralsn 4614	. . . . . . . . 9 ⊢ (∀𝑧 ∈ {0}𝑧 < 𝐴 ↔ 0 < 𝐴)
45	41, 44	sylibr 233	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑧 ∈ {0}𝑧 < 𝐴)
46		ralunb 4121	. . . . . . . . 9 ⊢ (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 ↔ (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴))
47	20	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑃 ∈ 𝐵)
48		prdsbl.e	. . . . . . . . . . . 12 ⊢ 𝐸 = ((dist‘𝑅) ↾ (𝑉 × 𝑉))
49		prdsbl.d	. . . . . . . . . . . 12 ⊢ 𝐷 = (dist‘𝑌)
50	1, 2, 24, 25, 26, 47, 27, 7, 48, 49	prdsdsval3 17113	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
51		xrltso 12804	. . . . . . . . . . . . 13 ⊢ < Or ℝ*
52	51	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → < Or ℝ*)
53	36	rnmpt 5853	. . . . . . . . . . . . . . 15 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))}
54		abrexfi 9049	. . . . . . . . . . . . . . 15 ⊢ (𝐼 ∈ Fin → {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))} ∈ Fin)
55	53, 54	eqeltrid 2843	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ Fin → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
56	25, 55	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
57		snfi 8788	. . . . . . . . . . . . 13 ⊢ {0} ∈ Fin
58		unfi 8917	. . . . . . . . . . . . 13 ⊢ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin ∧ {0} ∈ Fin) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
59	56, 57, 58	sylancl 585	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
60		ssun2 4103	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
61	42	snss 4716	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ↔ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
62	60, 61	mpbir 230	. . . . . . . . . . . . 13 ⊢ 0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
63		ne0i 4265	. . . . . . . . . . . . 13 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
64	62, 63	mp1i 13	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
65	34	fmpttd 6971	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))):𝐼⟶ℝ*)
66	65	frnd 6592	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ ℝ*)
67		0xr 10953	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℝ*
68	67	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 ∈ ℝ*)
69	68	snssd 4739	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → {0} ⊆ ℝ*)
70	66, 69	unssd 4116	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)
71		fisupcl 9158	. . . . . . . . . . . 12 ⊢ (( < Or ℝ* ∧ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅ ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
72	52, 59, 64, 70, 71	syl13anc 1370	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
73	50, 72	eqeltrd 2839	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
74		breq1 5073	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑃𝐷𝑓) → (𝑧 < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
75	74	rspcv 3547	. . . . . . . . . 10 ⊢ ((𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
76	73, 75	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
77	46, 76	syl5bir 242	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴) → (𝑃𝐷𝑓) < 𝐴))
78	45, 77	mpan2d 690	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
79	39, 78	sylbird 259	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
80		ssun1 4102	. . . . . . . . . . 11 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
81		ovex 7288	. . . . . . . . . . . . . 14 ⊢ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ V
82	81	elabrex 7098	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐼 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
83	82	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
84	83, 53	eleqtrrdi 2850	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))))
85	80, 84	sselid 3915	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
86		supxrub 12987	. . . . . . . . . 10 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ* ∧ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
87	70, 85, 86	syl2an2r 681	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
88	50	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
89	87, 88	breqtrrd 5098	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓))
90	1, 2, 7, 48, 49, 3, 4, 5, 16	prdsxmet 23430	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝐵))
91	90	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐷 ∈ (∞Met‘𝐵))
92	20	ad2antrr 722	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ 𝐵)
93	27	adantr 480	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑓 ∈ 𝐵)
94		xmetcl 23392	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ ℝ*)
95	91, 92, 93, 94	syl3anc 1369	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) ∈ ℝ*)
96		xrlelttr 12819	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* ∧ (𝑃𝐷𝑓) ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
97	34, 95, 19, 96	syl3anc 1369	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
98	89, 97	mpand 691	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃𝐷𝑓) < 𝐴 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
99	98	ralrimdva 3112	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
100	79, 99	impbid 211	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
101	15, 32, 100	3bitrrd 305	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
102	101	pm5.32da 578	. . 3 ⊢ (𝜑 → ((𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
103		elbl 23449	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝐴 ∈ ℝ*) → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
104	90, 20, 18, 103	syl3anc 1369	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
105	21	r19.21bi 3132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
106	18	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
107		blssm 23479	. . . . . . . . 9 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ 𝐴 ∈ ℝ*) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
108	16, 105, 106, 107	syl3anc 1369	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
109	108	ralrimiva 3107	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
110		ss2ixp 8656	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
111	109, 110	syl 17	. . . . . 6 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
112	111, 8	sseqtrrd 3958	. . . . 5 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝐵)
113	112	sseld 3916	. . . 4 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) → 𝑓 ∈ 𝐵))
114	113	pm4.71rd 562	. . 3 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
115	102, 104, 114	3bitr4d 310	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
116	115	eqrdv 2736	1 ⊢ (𝜑 → (𝑃(ball‘𝐷)𝐴) = X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1539   ∈ wcel 2108  {cab 2715   ≠ wne 2942  ∀wral 3063  ∃wrex 3064   ∪ cun 3881   ⊆ wss 3883  ∅c0 4253  {csn 4558   class class class wbr 5070   ↦ cmpt 5153   Or wor 5493   × cxp 5578  ran crn 5581   ↾ cres 5582   Fn wfn 6413  ‘cfv 6418  (class class class)co 7255  Xcixp 8643  Fincfn 8691  supcsup 9129  0cc0 10802  ℝ^*cxr 10939   < clt 10940   ≤ cle 10941  Basecbs 16840  distcds 16897  X_scprds 17073  ∞Metcxmet 20495  ballcbl 20497

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-cnex 10858  ax-resscn 10859  ax-1cn 10860  ax-icn 10861  ax-addcl 10862  ax-addrcl 10863  ax-mulcl 10864  ax-mulrcl 10865  ax-mulcom 10866  ax-addass 10867  ax-mulass 10868  ax-distr 10869  ax-i2m1 10870  ax-1ne0 10871  ax-1rid 10872  ax-rnegex 10873  ax-rrecex 10874  ax-cnre 10875  ax-pre-lttri 10876  ax-pre-lttrn 10877  ax-pre-ltadd 10878  ax-pre-mulgt0 10879  ax-pre-sup 10880

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-nel 3049  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-er 8456  df-map 8575  df-ixp 8644  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-sup 9131  df-pnf 10942  df-mnf 10943  df-xr 10944  df-ltxr 10945  df-le 10946  df-sub 11137  df-neg 11138  df-div 11563  df-nn 11904  df-2 11966  df-3 11967  df-4 11968  df-5 11969  df-6 11970  df-7 11971  df-8 11972  df-9 11973  df-n0 12164  df-z 12250  df-dec 12367  df-uz 12512  df-rp 12660  df-xneg 12777  df-xadd 12778  df-xmul 12779  df-icc 13015  df-fz 13169  df-struct 16776  df-slot 16811  df-ndx 16823  df-base 16841  df-plusg 16901  df-mulr 16902  df-sca 16904  df-vsca 16905  df-ip 16906  df-tset 16907  df-ple 16908  df-ds 16910  df-hom 16912  df-cco 16913  df-prds 17075  df-psmet 20502  df-xmet 20503  df-bl 20505

This theorem is referenced by:  prdsxmslem2  23591  prdstotbnd  35879  prdsbnd2  35880