Theorem prdsbl 23100

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 23114) - 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 3182	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
7		prdsbl.v	. . . . . . . . 9 ⊢ 𝑉 = (Base‘𝑅)
8	1, 2, 3, 4, 6, 7	prdsbas3 16753	. . . . . . . 8 ⊢ (𝜑 → 𝐵 = X𝑥 ∈ 𝐼 𝑉)
9	8	eleq2d 2898	. . . . . . 7 ⊢ (𝜑 → (𝑓 ∈ 𝐵 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉))
10	9	biimpa 479	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ X𝑥 ∈ 𝐼 𝑉)
11		ixpfn 8466	. . . . . 6 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 𝑉 → 𝑓 Fn 𝐼)
12		vex 3497	. . . . . . . 8 ⊢ 𝑓 ∈ V
13	12	elixp 8467	. . . . . . 7 ⊢ (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 Fn 𝐼 ∧ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
14	13	baib 538	. . . . . 6 ⊢ (𝑓 Fn 𝐼 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
15	10, 11, 14	3syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
16		prdsbl.m	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
17	16	adantlr 713	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (∞Met‘𝑉))
18		prdsbl.a	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℝ*)
19	18	ad2antrr 724	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
20		prdsbl.p	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ 𝐵)
21	1, 2, 3, 4, 6, 7, 20	prdsbascl 16755	. . . . . . . . 9 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
22	21	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑃‘𝑥) ∈ 𝑉)
23	22	r19.21bi 3208	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
24	3	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑆 ∈ 𝑊)
25	4	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝐼 ∈ Fin)
26	6	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 𝑅 ∈ 𝑍)
27		simpr 487	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑓 ∈ 𝐵)
28	1, 2, 24, 25, 26, 7, 27	prdsbascl 16755	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
29	28	r19.21bi 3208	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
30		elbl2 22999	. . . . . . 7 ⊢ (((𝐸 ∈ (∞Met‘𝑉) ∧ 𝐴 ∈ ℝ*) ∧ ((𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉)) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
31	17, 19, 23, 29, 30	syl22anc 836	. . . . . 6 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
32	31	ralbidva 3196	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
33		xmetcl 22940	. . . . . . . . . 10 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ (𝑓‘𝑥) ∈ 𝑉) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
34	17, 23, 29, 33	syl3anc 1367	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
35	34	ralrimiva 3182	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ*)
36		eqid 2821	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))
37		breq1 5068	. . . . . . . . 9 ⊢ (𝑧 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) → (𝑧 < 𝐴 ↔ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
38	36, 37	ralrnmptw 6859	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
39	35, 38	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ↔ ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
40		prdsbl.g	. . . . . . . . . 10 ⊢ (𝜑 → 0 < 𝐴)
41	40	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 < 𝐴)
42		c0ex 10634	. . . . . . . . . 10 ⊢ 0 ∈ V
43		breq1 5068	. . . . . . . . . 10 ⊢ (𝑧 = 0 → (𝑧 < 𝐴 ↔ 0 < 𝐴))
44	42, 43	ralsn 4618	. . . . . . . . 9 ⊢ (∀𝑧 ∈ {0}𝑧 < 𝐴 ↔ 0 < 𝐴)
45	41, 44	sylibr 236	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ∀𝑧 ∈ {0}𝑧 < 𝐴)
46		ralunb 4166	. . . . . . . . 9 ⊢ (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 ↔ (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴))
47	20	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 𝑃 ∈ 𝐵)
48		prdsbl.e	. . . . . . . . . . . 12 ⊢ 𝐸 = ((dist‘𝑅) ↾ (𝑉 × 𝑉))
49		prdsbl.d	. . . . . . . . . . . 12 ⊢ 𝐷 = (dist‘𝑌)
50	1, 2, 24, 25, 26, 47, 27, 7, 48, 49	prdsdsval3 16757	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
51		xrltso 12533	. . . . . . . . . . . . 13 ⊢ < Or ℝ*
52	51	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → < Or ℝ*)
53	36	rnmpt 5826	. . . . . . . . . . . . . . 15 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) = {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))}
54		abrexfi 8823	. . . . . . . . . . . . . . 15 ⊢ (𝐼 ∈ Fin → {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))} ∈ Fin)
55	53, 54	eqeltrid 2917	. . . . . . . . . . . . . 14 ⊢ (𝐼 ∈ Fin → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
56	25, 55	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin)
57		snfi 8593	. . . . . . . . . . . . 13 ⊢ {0} ∈ Fin
58		unfi 8784	. . . . . . . . . . . . 13 ⊢ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∈ Fin ∧ {0} ∈ Fin) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
59	56, 57, 58	sylancl 588	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin)
60		ssun2 4148	. . . . . . . . . . . . . 14 ⊢ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
61	42	snss 4717	. . . . . . . . . . . . . 14 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ↔ {0} ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
62	60, 61	mpbir 233	. . . . . . . . . . . . 13 ⊢ 0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
63		ne0i 4299	. . . . . . . . . . . . 13 ⊢ (0 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
64	62, 63	mp1i 13	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅)
65	34	fmpttd 6878	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))):𝐼⟶ℝ*)
66	65	frnd 6520	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ ℝ*)
67		0xr 10687	. . . . . . . . . . . . . . 15 ⊢ 0 ∈ ℝ*
68	67	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → 0 ∈ ℝ*)
69	68	snssd 4741	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → {0} ⊆ ℝ*)
70	66, 69	unssd 4161	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)
71		fisupcl 8932	. . . . . . . . . . . 12 ⊢ (( < Or ℝ* ∧ ((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ∈ Fin ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ≠ ∅ ∧ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ*)) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
72	52, 59, 64, 70, 71	syl13anc 1368	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
73	50, 72	eqeltrd 2913	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
74		breq1 5068	. . . . . . . . . . 11 ⊢ (𝑧 = (𝑃𝐷𝑓) → (𝑧 < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
75	74	rspcv 3617	. . . . . . . . . 10 ⊢ ((𝑃𝐷𝑓) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
76	73, 75	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
77	46, 76	syl5bir 245	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 ∧ ∀𝑧 ∈ {0}𝑧 < 𝐴) → (𝑃𝐷𝑓) < 𝐴))
78	45, 77	mpan2d 692	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑧 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)))𝑧 < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
79	39, 78	sylbird 262	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 → (𝑃𝐷𝑓) < 𝐴))
80		ssun1 4147	. . . . . . . . . . 11 ⊢ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ⊆ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})
81		ovex 7188	. . . . . . . . . . . . . 14 ⊢ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ V
82	81	elabrex 7001	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ 𝐼 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
83	82	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ {𝑦 ∣ ∃𝑥 ∈ 𝐼 𝑦 = ((𝑃‘𝑥)𝐸(𝑓‘𝑥))})
84	83, 53	eleqtrrdi 2924	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))))
85	80, 84	sseldi 3964	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}))
86		supxrub 12716	. . . . . . . . . 10 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}) ⊆ ℝ* ∧ ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0})) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
87	70, 85, 86	syl2an2r 683	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
88	50	adantr 483	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑃‘𝑥)𝐸(𝑓‘𝑥))) ∪ {0}), ℝ*, < ))
89	87, 88	breqtrrd 5093	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓))
90	1, 2, 7, 48, 49, 3, 4, 5, 16	prdsxmet 22978	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ∈ (∞Met‘𝐵))
91	90	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝐷 ∈ (∞Met‘𝐵))
92	20	ad2antrr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑃 ∈ 𝐵)
93	27	adantr 483	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → 𝑓 ∈ 𝐵)
94		xmetcl 22940	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝑓 ∈ 𝐵) → (𝑃𝐷𝑓) ∈ ℝ*)
95	91, 92, 93, 94	syl3anc 1367	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → (𝑃𝐷𝑓) ∈ ℝ*)
96		xrlelttr 12548	. . . . . . . . 9 ⊢ ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ∈ ℝ* ∧ (𝑃𝐷𝑓) ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
97	34, 95, 19, 96	syl3anc 1367	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((((𝑃‘𝑥)𝐸(𝑓‘𝑥)) ≤ (𝑃𝐷𝑓) ∧ (𝑃𝐷𝑓) < 𝐴) → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
98	89, 97	mpand 693	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑓 ∈ 𝐵) ∧ 𝑥 ∈ 𝐼) → ((𝑃𝐷𝑓) < 𝐴 → ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
99	98	ralrimdva 3189	. . . . . 6 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴))
100	79, 99	impbid 214	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)𝐸(𝑓‘𝑥)) < 𝐴 ↔ (𝑃𝐷𝑓) < 𝐴))
101	15, 32, 100	3bitrrd 308	. . . 4 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐵) → ((𝑃𝐷𝑓) < 𝐴 ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
102	101	pm5.32da 581	. . 3 ⊢ (𝜑 → ((𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
103		elbl 22997	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝐵) ∧ 𝑃 ∈ 𝐵 ∧ 𝐴 ∈ ℝ*) → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
104	90, 20, 18, 103	syl3anc 1367	. . 3 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ (𝑃𝐷𝑓) < 𝐴)))
105	21	r19.21bi 3208	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑃‘𝑥) ∈ 𝑉)
106	18	adantr 483	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐴 ∈ ℝ*)
107		blssm 23027	. . . . . . . . 9 ⊢ ((𝐸 ∈ (∞Met‘𝑉) ∧ (𝑃‘𝑥) ∈ 𝑉 ∧ 𝐴 ∈ ℝ*) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
108	16, 105, 106, 107	syl3anc 1367	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
109	108	ralrimiva 3182	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉)
110		ss2ixp 8473	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝑉 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
111	109, 110	syl 17	. . . . . 6 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ X𝑥 ∈ 𝐼 𝑉)
112	111, 8	sseqtrrd 4007	. . . . 5 ⊢ (𝜑 → X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ⊆ 𝐵)
113	112	sseld 3965	. . . 4 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) → 𝑓 ∈ 𝐵))
114	113	pm4.71rd 565	. . 3 ⊢ (𝜑 → (𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴) ↔ (𝑓 ∈ 𝐵 ∧ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))))
115	102, 104, 114	3bitr4d 313	. 2 ⊢ (𝜑 → (𝑓 ∈ (𝑃(ball‘𝐷)𝐴) ↔ 𝑓 ∈ X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴)))
116	115	eqrdv 2819	1 ⊢ (𝜑 → (𝑃(ball‘𝐷)𝐴) = X𝑥 ∈ 𝐼 ((𝑃‘𝑥)(ball‘𝐸)𝐴))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   = wceq 1533   ∈ wcel 2110  {cab 2799   ≠ wne 3016  ∀wral 3138  ∃wrex 3139   ∪ cun 3933   ⊆ wss 3935  ∅c0 4290  {csn 4566   class class class wbr 5065   ↦ cmpt 5145   Or wor 5472   × cxp 5552  ran crn 5555   ↾ cres 5556   Fn wfn 6349  ‘cfv 6354  (class class class)co 7155  Xcixp 8460  Fincfn 8508  supcsup 8903  0cc0 10536  ℝ^*cxr 10673   < clt 10674   ≤ cle 10675  Basecbs 16482  distcds 16573  X_scprds 16718  ∞Metcxmet 20529  ballcbl 20531

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613  ax-pre-sup 10614

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-int 4876  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-oadd 8105  df-er 8288  df-map 8407  df-ixp 8461  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-sup 8905  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-div 11297  df-nn 11638  df-2 11699  df-3 11700  df-4 11701  df-5 11702  df-6 11703  df-7 11704  df-8 11705  df-9 11706  df-n0 11897  df-z 11981  df-dec 12098  df-uz 12243  df-rp 12389  df-xneg 12506  df-xadd 12507  df-xmul 12508  df-icc 12744  df-fz 12892  df-struct 16484  df-ndx 16485  df-slot 16486  df-base 16488  df-plusg 16577  df-mulr 16578  df-sca 16580  df-vsca 16581  df-ip 16582  df-tset 16583  df-ple 16584  df-ds 16586  df-hom 16588  df-cco 16589  df-prds 16720  df-psmet 20536  df-xmet 20537  df-bl 20539

This theorem is referenced by:  prdsxmslem2  23138  prdstotbnd  35071  prdsbnd2  35072