Theorem prdsbnd 38477

Description: The product metric over finite index set is bounded if all the factors are bounded. (Contributed by Mario Carneiro, 13-Sep-2015.)

Hypotheses

Ref	Expression
prdsbnd.y	⊢ 𝑌 = (𝑆Xs𝑅)
prdsbnd.b	⊢ 𝐵 = (Base‘𝑌)
prdsbnd.v	⊢ 𝑉 = (Base‘(𝑅‘𝑥))
prdsbnd.e	⊢ 𝐸 = ((dist‘(𝑅‘𝑥)) ↾ (𝑉 × 𝑉))
prdsbnd.d	⊢ 𝐷 = (dist‘𝑌)
prdsbnd.s	⊢ (𝜑 → 𝑆 ∈ 𝑊)
prdsbnd.i	⊢ (𝜑 → 𝐼 ∈ Fin)
prdsbnd.r	⊢ (𝜑 → 𝑅 Fn 𝐼)
prdsbnd.m	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Bnd‘𝑉))

Assertion

Ref	Expression
prdsbnd	⊢ (𝜑 → 𝐷 ∈ (Bnd‘𝐵))

Distinct variable groups:   𝑥,𝑅   𝑥,𝐵   𝜑,𝑥   𝑥,𝐼   𝑥,𝑆   𝑥,𝑌

Allowed substitution hints:   𝐷(𝑥)   𝐸(𝑥)   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem prdsbnd

Dummy variables 𝑧 𝑓 𝑔 𝑘 𝑚 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2765	. . . 4 ⊢ (𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))) = (𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
2		eqid 2765	. . . 4 ⊢ (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) = (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
3		prdsbnd.v	. . . 4 ⊢ 𝑉 = (Base‘(𝑅‘𝑥))
4		prdsbnd.e	. . . 4 ⊢ 𝐸 = ((dist‘(𝑅‘𝑥)) ↾ (𝑉 × 𝑉))
5		eqid 2765	. . . 4 ⊢ (dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) = (dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
6		prdsbnd.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
7		prdsbnd.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ Fin)
8		fvexd 6900	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ V)
9		prdsbnd.m	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Bnd‘𝑉))
10		bndmet 38465	. . . . 5 ⊢ (𝐸 ∈ (Bnd‘𝑉) → 𝐸 ∈ (Met‘𝑉))
11	9, 10	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Met‘𝑉))
12	1, 2, 3, 4, 5, 6, 7, 8, 11	prdsmet 24558	. . 3 ⊢ (𝜑 → (dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) ∈ (Met‘(Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))))
13		prdsbnd.d	. . . 4 ⊢ 𝐷 = (dist‘𝑌)
14		prdsbnd.y	. . . . . 6 ⊢ 𝑌 = (𝑆Xs𝑅)
15		prdsbnd.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
16		dffn5 6943	. . . . . . . 8 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅 = (𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
17	15, 16	sylib 221	. . . . . . 7 ⊢ (𝜑 → 𝑅 = (𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
18	17	oveq2d 7432	. . . . . 6 ⊢ (𝜑 → (𝑆Xs𝑅) = (𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
19	14, 18	eqtrid 2812	. . . . 5 ⊢ (𝜑 → 𝑌 = (𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
20	19	fveq2d 6889	. . . 4 ⊢ (𝜑 → (dist‘𝑌) = (dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
21	13, 20	eqtrid 2812	. . 3 ⊢ (𝜑 → 𝐷 = (dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
22		prdsbnd.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
23	19	fveq2d 6889	. . . . 5 ⊢ (𝜑 → (Base‘𝑌) = (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
24	22, 23	eqtrid 2812	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
25	24	fveq2d 6889	. . 3 ⊢ (𝜑 → (Met‘𝐵) = (Met‘(Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))))
26	12, 21, 25	3eltr4d 2880	. 2 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝐵))
27		isbnd3 38468	. . . . . . 7 ⊢ (𝐸 ∈ (Bnd‘𝑉) ↔ (𝐸 ∈ (Met‘𝑉) ∧ ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤)))
28	27	simprbi 503	. . . . . 6 ⊢ (𝐸 ∈ (Bnd‘𝑉) → ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
29	9, 28	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
30	29	ralrimiva 3159	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
31		oveq2 7424	. . . . . 6 ⊢ (𝑤 = (𝑘‘𝑥) → (0[,]𝑤) = (0[,](𝑘‘𝑥)))
32	31	feq3d 6694	. . . . 5 ⊢ (𝑤 = (𝑘‘𝑥) → (𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤) ↔ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
33	32	ac6sfi 9247	. . . 4 ⊢ ((𝐼 ∈ Fin ∧ ∀𝑥 ∈ 𝐼 ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤)) → ∃𝑘(𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
34	7, 30, 33	syl2anc 596	. . 3 ⊢ (𝜑 → ∃𝑘(𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
35		frn 6717	. . . . . . . 8 ⊢ (𝑘:𝐼⟶ℝ → ran 𝑘 ⊆ ℝ)
36	35	adantl 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ran 𝑘 ⊆ ℝ)
37		0red 11222	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℝ)
38	37	snssd 4754	. . . . . . . 8 ⊢ (𝜑 → {0} ⊆ ℝ)
39	38	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → {0} ⊆ ℝ)
40	36, 39	unssd 4145	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
41		ffn 6709	. . . . . . . . . 10 ⊢ (𝑘:𝐼⟶ℝ → 𝑘 Fn 𝐼)
42		dffn4 6802	. . . . . . . . . 10 ⊢ (𝑘 Fn 𝐼 ↔ 𝑘:𝐼–onto→ran 𝑘)
43	41, 42	sylib 221	. . . . . . . . 9 ⊢ (𝑘:𝐼⟶ℝ → 𝑘:𝐼–onto→ran 𝑘)
44		fofi 9276	. . . . . . . . 9 ⊢ ((𝐼 ∈ Fin ∧ 𝑘:𝐼–onto→ran 𝑘) → ran 𝑘 ∈ Fin)
45	7, 43, 44	syl2an 608	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ran 𝑘 ∈ Fin)
46		snfi 9043	. . . . . . . 8 ⊢ {0} ∈ Fin
47		unfi 9158	. . . . . . . 8 ⊢ ((ran 𝑘 ∈ Fin ∧ {0} ∈ Fin) → (ran 𝑘 ∪ {0}) ∈ Fin)
48	45, 46, 47	sylancl 598	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ∈ Fin)
49		ssun2 4132	. . . . . . . . 9 ⊢ {0} ⊆ (ran 𝑘 ∪ {0})
50		c0ex 11211	. . . . . . . . . 10 ⊢ 0 ∈ V
51	50	snid 4630	. . . . . . . . 9 ⊢ 0 ∈ {0}
52	49, 51	sselii 3935	. . . . . . . 8 ⊢ 0 ∈ (ran 𝑘 ∪ {0})
53		ne0i 4294	. . . . . . . 8 ⊢ (0 ∈ (ran 𝑘 ∪ {0}) → (ran 𝑘 ∪ {0}) ≠ ∅)
54	52, 53	mp1i 14	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ≠ ∅)
55		ltso 11301	. . . . . . . 8 ⊢ < Or ℝ
56		fisupcl 9433	. . . . . . . 8 ⊢ (( < Or ℝ ∧ ((ran 𝑘 ∪ {0}) ∈ Fin ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ (ran 𝑘 ∪ {0}) ⊆ ℝ)) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
57	55, 56	mpan 703	. . . . . . 7 ⊢ (((ran 𝑘 ∪ {0}) ∈ Fin ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ (ran 𝑘 ∪ {0}) ⊆ ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
58	48, 54, 40, 57	syl3anc 1398	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
59	40, 58	sseldd 3939	. . . . 5 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
60	59	adantrr 730	. . . 4 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
61		metf 24518	. . . . . . 7 ⊢ (𝐷 ∈ (Met‘𝐵) → 𝐷:(𝐵 × 𝐵)⟶ℝ)
62		ffn 6709	. . . . . . 7 ⊢ (𝐷:(𝐵 × 𝐵)⟶ℝ → 𝐷 Fn (𝐵 × 𝐵))
63	26, 61, 62	3syl 19	. . . . . 6 ⊢ (𝜑 → 𝐷 Fn (𝐵 × 𝐵))
64	63	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷 Fn (𝐵 × 𝐵))
65	26	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷 ∈ (Met‘𝐵))
66		simprl 783	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑓 ∈ 𝐵)
67	66	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑓 ∈ 𝐵)
68		simprr 785	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑔 ∈ 𝐵)
69	68	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑔 ∈ 𝐵)
70		metcl 24520	. . . . . . . . 9 ⊢ ((𝐷 ∈ (Met‘𝐵) ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → (𝑓𝐷𝑔) ∈ ℝ)
71	65, 67, 69, 70	syl3anc 1398	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ∈ ℝ)
72		metge0 24533	. . . . . . . . 9 ⊢ ((𝐷 ∈ (Met‘𝐵) ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → 0 ≤ (𝑓𝐷𝑔))
73	65, 67, 69, 72	syl3anc 1398	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ≤ (𝑓𝐷𝑔))
74	21	oveqdr 7444	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) = (𝑓(dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))𝑔))
75	6	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑆 ∈ 𝑊)
76	7	adantr 486	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝐼 ∈ Fin)
77		fvexd 6900	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ V)
78	77	ralrimiva 3159	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑅‘𝑥) ∈ V)
79	24	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝐵 = (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
80	66, 79	eleqtrd 2867	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑓 ∈ (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
81	68, 79	eleqtrd 2867	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑔 ∈ (Base‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
82	1, 2, 75, 76, 78, 80, 81, 3, 4, 5	prdsdsval3 17556	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓(dist‘(𝑆Xs(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))
83	74, 82	eqtrd 2800	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))
84	83	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ))
85	11	adantlr 728	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Met‘𝑉))
86	1, 2, 75, 76, 78, 3, 80	prdsbascl 17554	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
87	86	r19.21bi 3259	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
88	1, 2, 75, 76, 78, 3, 81	prdsbascl 17554	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑔‘𝑥) ∈ 𝑉)
89	88	r19.21bi 3259	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑔‘𝑥) ∈ 𝑉)
90		metcl 24520	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸 ∈ (Met‘𝑉) ∧ (𝑓‘𝑥) ∈ 𝑉 ∧ (𝑔‘𝑥) ∈ 𝑉) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
91	85, 87, 89, 90	syl3anc 1398	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
92	91	ad2ant2r 760	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
93		ffvelcdm 7080	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘:𝐼⟶ℝ ∧ 𝑥 ∈ 𝐼) → (𝑘‘𝑥) ∈ ℝ)
94	93	ad2ant2lr 761	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ ℝ)
95	59	adantlr 728	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
96	95	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
97		simprr 785	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))
98	87	ad2ant2r 760	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓‘𝑥) ∈ 𝑉)
99	89	ad2ant2r 760	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑔‘𝑥) ∈ 𝑉)
100	97, 98, 99	fovcdmd 7588	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)))
101		0re 11221	. . . . . . . . . . . . . . . . . . 19 ⊢ 0 ∈ ℝ
102		elicc2 13450	. . . . . . . . . . . . . . . . . . 19 ⊢ ((0 ∈ ℝ ∧ (𝑘‘𝑥) ∈ ℝ) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)) ↔ (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))))
103	101, 94, 102	sylancr 599	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)) ↔ (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))))
104	100, 103	mpbid 235	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥)))
105	104	simp3d 1162	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))
106	40	adantlr 728	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
107	106	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
108	52, 53	mp1i 14	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ≠ ∅)
109		fimaxre2 12171	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ∈ Fin) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
110	40, 48, 109	syl2anc 596	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
111	110	adantlr 728	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
112	111	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
113		ssun1 4131	. . . . . . . . . . . . . . . . . 18 ⊢ ran 𝑘 ⊆ (ran 𝑘 ∪ {0})
114	41	ad2antlr 740	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑘 Fn 𝐼)
115		simprl 783	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑥 ∈ 𝐼)
116		fnfvelrn 7079	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 Fn 𝐼 ∧ 𝑥 ∈ 𝐼) → (𝑘‘𝑥) ∈ ran 𝑘)
117	114, 115, 116	syl2anc 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ ran 𝑘)
118	113, 117	sselid 3936	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ (ran 𝑘 ∪ {0}))
119		suprub 12187	. . . . . . . . . . . . . . . . 17 ⊢ ((((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧) ∧ (𝑘‘𝑥) ∈ (ran 𝑘 ∪ {0})) → (𝑘‘𝑥) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
120	107, 108, 112, 118, 119	syl31anc 1400	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
121	92, 94, 96, 105, 120	letrd 11378	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
122	121	expr 462	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ 𝑥 ∈ 𝐼) → (𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
123	122	ralimdva 3179	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → (∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)) → ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
124	123	impr 460	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
125		ovex 7449	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ V
126	125	rgenw 3085	. . . . . . . . . . . . 13 ⊢ ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ V
127		eqid 2765	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))
128		breq1 5114	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) → (𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
129	127, 128	ralrnmptw 7093	. . . . . . . . . . . . 13 ⊢ (∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ V → (∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
130	126, 129	ax-mp 5	. . . . . . . . . . . 12 ⊢ (∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
131	124, 130	sylibr 237	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
132	40	ad2ant2r 760	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
133	52, 53	mp1i 14	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ≠ ∅)
134	110	ad2ant2r 760	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
135	52	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ∈ (ran 𝑘 ∪ {0}))
136		suprub 12187	. . . . . . . . . . . . . 14 ⊢ ((((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧) ∧ 0 ∈ (ran 𝑘 ∪ {0})) → 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
137	132, 133, 134, 135, 136	syl31anc 1400	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
138		elsni 4608	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ {0} → 𝑤 = 0)
139	138	breq1d 5121	. . . . . . . . . . . . 13 ⊢ (𝑤 ∈ {0} → (𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
140	137, 139	syl5ibrcom 250	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑤 ∈ {0} → 𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
141	140	ralrimiv 3158	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ {0}𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
142		ralunb 4150	. . . . . . . . . . 11 ⊢ (∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ (∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∧ ∀𝑤 ∈ {0}𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
143	131, 141, 142	sylanbrc 595	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
144	91	fmpttd 7114	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))):𝐼⟶ℝ)
145	144	frnd 6718	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ⊆ ℝ)
146		0red 11222	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 0 ∈ ℝ)
147	146	snssd 4754	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → {0} ⊆ ℝ)
148	145, 147	unssd 4145	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ)
149		ressxr 11264	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℝ*
150	148, 149	sstrdi 3950	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ*)
151	150	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ*)
152	60	adantlr 728	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
153	152	rexrd 11270	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ*)
154		supxrleub 13364	. . . . . . . . . . 11 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ* ∧ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ*) → (sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
155	151, 153, 154	syl2anc 596	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
156	143, 155	mpbird 260	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ*, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
157	84, 156	eqbrtrd 5135	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
158		elicc2 13450	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ) → ((𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ ((𝑓𝐷𝑔) ∈ ℝ ∧ 0 ≤ (𝑓𝐷𝑔) ∧ (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))))
159	101, 152, 158	sylancr 599	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ ((𝑓𝐷𝑔) ∈ ℝ ∧ 0 ≤ (𝑓𝐷𝑔) ∧ (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))))
160	71, 73, 157, 159	mpbir3and 1361	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
161	160	an32s 665	. . . . . 6 ⊢ (((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
162	161	ralrimivva 3210	. . . . 5 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
163		ffnov 7542	. . . . 5 ⊢ (𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ (𝐷 Fn (𝐵 × 𝐵) ∧ ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))))
164	64, 162, 163	sylanbrc 595	. . . 4 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
165		oveq2 7424	. . . . . 6 ⊢ (𝑚 = sup((ran 𝑘 ∪ {0}), ℝ, < ) → (0[,]𝑚) = (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
166	165	feq3d 6694	. . . . 5 ⊢ (𝑚 = sup((ran 𝑘 ∪ {0}), ℝ, < ) → (𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚) ↔ 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))))
167	166	rspcev 3583	. . . 4 ⊢ ((sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ ∧ 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))) → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
168	60, 164, 167	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
169	34, 168	exlimddv 1968	. 2 ⊢ (𝜑 → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
170		isbnd3 38468	. 2 ⊢ (𝐷 ∈ (Bnd‘𝐵) ↔ (𝐷 ∈ (Met‘𝐵) ∧ ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚)))
171	26, 169, 170	sylanbrc 595	1 ⊢ (𝜑 → 𝐷 ∈ (Bnd‘𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2146   ≠ wne 2960  ∀wral 3081  ∃wrex 3091  Vcvv 3457   ∪ cun 3904   ⊆ wss 3906  ∅c0 4286  {csn 4591   class class class wbr 5111   ↦ cmpt 5194   Or wor 5570   × cxp 5661  ran crn 5664   ↾ cres 5665   Fn wfn 6535  ⟶wf 6536  –onto→wfo 6538  ‘cfv 6540  (class class class)co 7416  Fincfn 8945  supcsup 9403  ℝcr 11110  0cc0 11111  ℝ^*cxr 11253   < clt 11254   ≤ cle 11255  [,]cicc 13387  Basecbs 17287  distcds 17337  X_scprds 17516  Metcmet 21538  Bndcbnd 38451

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188  ax-pre-sup 11189

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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-ec 8698  df-map 8828  df-ixp 8898  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-sup 9405  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-div 11883  df-nn 12245  df-2 12314  df-3 12315  df-4 12316  df-5 12317  df-6 12318  df-7 12319  df-8 12320  df-9 12321  df-n0 12516  df-z 12603  df-dec 12724  df-uz 12875  df-rp 13029  df-xneg 13149  df-xadd 13150  df-xmul 13151  df-icc 13391  df-fz 13548  df-struct 17225  df-slot 17260  df-ndx 17272  df-base 17288  df-plusg 17341  df-mulr 17342  df-sca 17344  df-vsca 17345  df-ip 17346  df-tset 17347  df-ple 17348  df-ds 17350  df-hom 17352  df-cco 17353  df-prds 17518  df-psmet 21544  df-xmet 21545  df-met 21546  df-bl 21547  df-bnd 38463

This theorem is used by: (None)