prdsbnd - Mathbox for Jeff Madsen

	Mathbox for Jeff Madsen		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > prdsbnd		Structured version Visualization version GIF version

Theorem prdsbnd 37794

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	⊢ 𝑌 = (𝑆X_s𝑅)
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 2730	. . . 4 ⊢ (𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))) = (𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
2		eqid 2730	. . . 4 ⊢ (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) = (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
3		prdsbnd.v	. . . 4 ⊢ 𝑉 = (Base‘(𝑅‘𝑥))
4		prdsbnd.e	. . . 4 ⊢ 𝐸 = ((dist‘(𝑅‘𝑥)) ↾ (𝑉 × 𝑉))
5		eqid 2730	. . . 4 ⊢ (dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) = (dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
6		prdsbnd.s	. . . 4 ⊢ (𝜑 → 𝑆 ∈ 𝑊)
7		prdsbnd.i	. . . 4 ⊢ (𝜑 → 𝐼 ∈ Fin)
8		fvexd 6876	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ V)
9		prdsbnd.m	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Bnd‘𝑉))
10		bndmet 37782	. . . . 5 ⊢ (𝐸 ∈ (Bnd‘𝑉) → 𝐸 ∈ (Met‘𝑉))
11	9, 10	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Met‘𝑉))
12	1, 2, 3, 4, 5, 6, 7, 8, 11	prdsmet 24265	. . 3 ⊢ (𝜑 → (dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))) ∈ (Met‘(Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))))
13		prdsbnd.d	. . . 4 ⊢ 𝐷 = (dist‘𝑌)
14		prdsbnd.y	. . . . . 6 ⊢ 𝑌 = (𝑆X_s𝑅)
15		prdsbnd.r	. . . . . . . 8 ⊢ (𝜑 → 𝑅 Fn 𝐼)
16		dffn5 6922	. . . . . . . 8 ⊢ (𝑅 Fn 𝐼 ↔ 𝑅 = (𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
17	15, 16	sylib 218	. . . . . . 7 ⊢ (𝜑 → 𝑅 = (𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))
18	17	oveq2d 7406	. . . . . 6 ⊢ (𝜑 → (𝑆X_s𝑅) = (𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
19	14, 18	eqtrid 2777	. . . . 5 ⊢ (𝜑 → 𝑌 = (𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))
20	19	fveq2d 6865	. . . 4 ⊢ (𝜑 → (dist‘𝑌) = (dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
21	13, 20	eqtrid 2777	. . 3 ⊢ (𝜑 → 𝐷 = (dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
22		prdsbnd.b	. . . . 5 ⊢ 𝐵 = (Base‘𝑌)
23	19	fveq2d 6865	. . . . 5 ⊢ (𝜑 → (Base‘𝑌) = (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
24	22, 23	eqtrid 2777	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
25	24	fveq2d 6865	. . 3 ⊢ (𝜑 → (Met‘𝐵) = (Met‘(Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))))
26	12, 21, 25	3eltr4d 2844	. 2 ⊢ (𝜑 → 𝐷 ∈ (Met‘𝐵))
27		isbnd3 37785	. . . . . . 7 ⊢ (𝐸 ∈ (Bnd‘𝑉) ↔ (𝐸 ∈ (Met‘𝑉) ∧ ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤)))
28	27	simprbi 496	. . . . . 6 ⊢ (𝐸 ∈ (Bnd‘𝑉) → ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
29	9, 28	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐼) → ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
30	29	ralrimiva 3126	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐼 ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤))
31		oveq2 7398	. . . . . 6 ⊢ (𝑤 = (𝑘‘𝑥) → (0[,]𝑤) = (0[,](𝑘‘𝑥)))
32	31	feq3d 6676	. . . . 5 ⊢ (𝑤 = (𝑘‘𝑥) → (𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤) ↔ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
33	32	ac6sfi 9238	. . . 4 ⊢ ((𝐼 ∈ Fin ∧ ∀𝑥 ∈ 𝐼 ∃𝑤 ∈ ℝ 𝐸:(𝑉 × 𝑉)⟶(0[,]𝑤)) → ∃𝑘(𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
34	7, 30, 33	syl2anc 584	. . 3 ⊢ (𝜑 → ∃𝑘(𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥))))
35		frn 6698	. . . . . . . 8 ⊢ (𝑘:𝐼⟶ℝ → ran 𝑘 ⊆ ℝ)
36	35	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ran 𝑘 ⊆ ℝ)
37		0red 11184	. . . . . . . . 9 ⊢ (𝜑 → 0 ∈ ℝ)
38	37	snssd 4776	. . . . . . . 8 ⊢ (𝜑 → {0} ⊆ ℝ)
39	38	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → {0} ⊆ ℝ)
40	36, 39	unssd 4158	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
41		ffn 6691	. . . . . . . . . 10 ⊢ (𝑘:𝐼⟶ℝ → 𝑘 Fn 𝐼)
42		dffn4 6781	. . . . . . . . . 10 ⊢ (𝑘 Fn 𝐼 ↔ 𝑘:𝐼–onto→ran 𝑘)
43	41, 42	sylib 218	. . . . . . . . 9 ⊢ (𝑘:𝐼⟶ℝ → 𝑘:𝐼–onto→ran 𝑘)
44		fofi 9269	. . . . . . . . 9 ⊢ ((𝐼 ∈ Fin ∧ 𝑘:𝐼–onto→ran 𝑘) → ran 𝑘 ∈ Fin)
45	7, 43, 44	syl2an 596	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ran 𝑘 ∈ Fin)
46		snfi 9017	. . . . . . . 8 ⊢ {0} ∈ Fin
47		unfi 9141	. . . . . . . 8 ⊢ ((ran 𝑘 ∈ Fin ∧ {0} ∈ Fin) → (ran 𝑘 ∪ {0}) ∈ Fin)
48	45, 46, 47	sylancl 586	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ∈ Fin)
49		ssun2 4145	. . . . . . . . 9 ⊢ {0} ⊆ (ran 𝑘 ∪ {0})
50		c0ex 11175	. . . . . . . . . 10 ⊢ 0 ∈ V
51	50	snid 4629	. . . . . . . . 9 ⊢ 0 ∈ {0}
52	49, 51	sselii 3946	. . . . . . . 8 ⊢ 0 ∈ (ran 𝑘 ∪ {0})
53		ne0i 4307	. . . . . . . 8 ⊢ (0 ∈ (ran 𝑘 ∪ {0}) → (ran 𝑘 ∪ {0}) ≠ ∅)
54	52, 53	mp1i 13	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ≠ ∅)
55		ltso 11261	. . . . . . . 8 ⊢ < Or ℝ
56		fisupcl 9428	. . . . . . . 8 ⊢ (( < Or ℝ ∧ ((ran 𝑘 ∪ {0}) ∈ Fin ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ (ran 𝑘 ∪ {0}) ⊆ ℝ)) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
57	55, 56	mpan 690	. . . . . . 7 ⊢ (((ran 𝑘 ∪ {0}) ∈ Fin ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ (ran 𝑘 ∪ {0}) ⊆ ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
58	48, 54, 40, 57	syl3anc 1373	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ (ran 𝑘 ∪ {0}))
59	40, 58	sseldd 3950	. . . . 5 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
60	59	adantrr 717	. . . 4 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
61		metf 24225	. . . . . . 7 ⊢ (𝐷 ∈ (Met‘𝐵) → 𝐷:(𝐵 × 𝐵)⟶ℝ)
62		ffn 6691	. . . . . . 7 ⊢ (𝐷:(𝐵 × 𝐵)⟶ℝ → 𝐷 Fn (𝐵 × 𝐵))
63	26, 61, 62	3syl 18	. . . . . 6 ⊢ (𝜑 → 𝐷 Fn (𝐵 × 𝐵))
64	63	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷 Fn (𝐵 × 𝐵))
65	26	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷 ∈ (Met‘𝐵))
66		simprl 770	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑓 ∈ 𝐵)
67	66	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑓 ∈ 𝐵)
68		simprr 772	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑔 ∈ 𝐵)
69	68	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑔 ∈ 𝐵)
70		metcl 24227	. . . . . . . . 9 ⊢ ((𝐷 ∈ (Met‘𝐵) ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → (𝑓𝐷𝑔) ∈ ℝ)
71	65, 67, 69, 70	syl3anc 1373	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ∈ ℝ)
72		metge0 24240	. . . . . . . . 9 ⊢ ((𝐷 ∈ (Met‘𝐵) ∧ 𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵) → 0 ≤ (𝑓𝐷𝑔))
73	65, 67, 69, 72	syl3anc 1373	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ≤ (𝑓𝐷𝑔))
74	21	oveqdr 7418	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) = (𝑓(dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))𝑔))
75	6	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑆 ∈ 𝑊)
76	7	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝐼 ∈ Fin)
77		fvexd 6876	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑅‘𝑥) ∈ V)
78	77	ralrimiva 3126	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑅‘𝑥) ∈ V)
79	24	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝐵 = (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
80	66, 79	eleqtrd 2831	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑓 ∈ (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
81	68, 79	eleqtrd 2831	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 𝑔 ∈ (Base‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥)))))
82	1, 2, 75, 76, 78, 80, 81, 3, 4, 5	prdsdsval3 17455	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓(dist‘(𝑆X_s(𝑥 ∈ 𝐼 ↦ (𝑅‘𝑥))))𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^*, < ))
83	74, 82	eqtrd 2765	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^*, < ))
84	83	adantr 480	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) = sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^*, < ))
85	11	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → 𝐸 ∈ (Met‘𝑉))
86	1, 2, 75, 76, 78, 3, 80	prdsbascl 17453	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑓‘𝑥) ∈ 𝑉)
87	86	r19.21bi 3230	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑓‘𝑥) ∈ 𝑉)
88	1, 2, 75, 76, 78, 3, 81	prdsbascl 17453	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ∀𝑥 ∈ 𝐼 (𝑔‘𝑥) ∈ 𝑉)
89	88	r19.21bi 3230	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → (𝑔‘𝑥) ∈ 𝑉)
90		metcl 24227	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐸 ∈ (Met‘𝑉) ∧ (𝑓‘𝑥) ∈ 𝑉 ∧ (𝑔‘𝑥) ∈ 𝑉) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
91	85, 87, 89, 90	syl3anc 1373	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑥 ∈ 𝐼) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
92	91	ad2ant2r 747	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ)
93		ffvelcdm 7056	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘:𝐼⟶ℝ ∧ 𝑥 ∈ 𝐼) → (𝑘‘𝑥) ∈ ℝ)
94	93	ad2ant2lr 748	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ ℝ)
95	59	adantlr 715	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
96	95	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
97		simprr 772	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))
98	87	ad2ant2r 747	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓‘𝑥) ∈ 𝑉)
99	89	ad2ant2r 747	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑔‘𝑥) ∈ 𝑉)
100	97, 98, 99	fovcdmd 7564	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)))
101		0re 11183	. . . . . . . . . . . . . . . . . . 19 ⊢ 0 ∈ ℝ
102		elicc2 13379	. . . . . . . . . . . . . . . . . . 19 ⊢ ((0 ∈ ℝ ∧ (𝑘‘𝑥) ∈ ℝ) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)) ↔ (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))))
103	101, 94, 102	sylancr 587	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ (0[,](𝑘‘𝑥)) ↔ (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))))
104	100, 103	mpbid 232	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ ℝ ∧ 0 ≤ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∧ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥)))
105	104	simp3d 1144	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ (𝑘‘𝑥))
106	40	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
107	106	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
108	52, 53	mp1i 13	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ≠ ∅)
109		fimaxre2 12135	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ∈ Fin) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
110	40, 48, 109	syl2anc 584	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘:𝐼⟶ℝ) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
111	110	adantlr 715	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
112	111	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
113		ssun1 4144	. . . . . . . . . . . . . . . . . 18 ⊢ ran 𝑘 ⊆ (ran 𝑘 ∪ {0})
114	41	ad2antlr 727	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑘 Fn 𝐼)
115		simprl 770	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝑥 ∈ 𝐼)
116		fnfvelrn 7055	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 Fn 𝐼 ∧ 𝑥 ∈ 𝐼) → (𝑘‘𝑥) ∈ ran 𝑘)
117	114, 115, 116	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ ran 𝑘)
118	113, 117	sselid 3947	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ∈ (ran 𝑘 ∪ {0}))
119		suprub 12151	. . . . . . . . . . . . . . . . 17 ⊢ ((((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧) ∧ (𝑘‘𝑥) ∈ (ran 𝑘 ∪ {0})) → (𝑘‘𝑥) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
120	107, 108, 112, 118, 119	syl31anc 1375	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑘‘𝑥) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
121	92, 94, 96, 105, 120	letrd 11338	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ (𝑥 ∈ 𝐼 ∧ 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
122	121	expr 456	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) ∧ 𝑥 ∈ 𝐼) → (𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)) → ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
123	122	ralimdva 3146	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ 𝑘:𝐼⟶ℝ) → (∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)) → ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
124	123	impr 454	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
125		ovex 7423	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ V
126	125	rgenw 3049	. . . . . . . . . . . . 13 ⊢ ∀𝑥 ∈ 𝐼 ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ∈ V
127		eqid 2730	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))
128		breq1 5113	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) → (𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
129	127, 128	ralrnmptw 7069	. . . . . . . . . . . . 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 234	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
132	40	ad2ant2r 747	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ⊆ ℝ)
133	52, 53	mp1i 13	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran 𝑘 ∪ {0}) ≠ ∅)
134	110	ad2ant2r 747	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧)
135	52	a1i 11	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ∈ (ran 𝑘 ∪ {0}))
136		suprub 12151	. . . . . . . . . . . . . 14 ⊢ ((((ran 𝑘 ∪ {0}) ⊆ ℝ ∧ (ran 𝑘 ∪ {0}) ≠ ∅ ∧ ∃𝑧 ∈ ℝ ∀𝑤 ∈ (ran 𝑘 ∪ {0})𝑤 ≤ 𝑧) ∧ 0 ∈ (ran 𝑘 ∪ {0})) → 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
137	132, 133, 134, 135, 136	syl31anc 1375	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
138		elsni 4609	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ {0} → 𝑤 = 0)
139	138	breq1d 5120	. . . . . . . . . . . . 13 ⊢ (𝑤 ∈ {0} → (𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ 0 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
140	137, 139	syl5ibrcom 247	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑤 ∈ {0} → 𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
141	140	ralrimiv 3125	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ {0}𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
142		ralunb 4163	. . . . . . . . . . 11 ⊢ (∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ (∀𝑤 ∈ ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥)))𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∧ ∀𝑤 ∈ {0}𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
143	131, 141, 142	sylanbrc 583	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
144	91	fmpttd 7090	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))):𝐼⟶ℝ)
145	144	frnd 6699	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ⊆ ℝ)
146		0red 11184	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → 0 ∈ ℝ)
147	146	snssd 4776	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → {0} ⊆ ℝ)
148	145, 147	unssd 4158	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ)
149		ressxr 11225	. . . . . . . . . . . . 13 ⊢ ℝ ⊆ ℝ^*
150	148, 149	sstrdi 3962	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ^*)
151	150	adantr 480	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ^*)
152	60	adantlr 715	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ)
153	152	rexrd 11231	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ^*)
154		supxrleub 13293	. . . . . . . . . . 11 ⊢ (((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}) ⊆ ℝ^* ∧ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ^) → (sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
155	151, 153, 154	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^*, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ) ↔ ∀𝑤 ∈ (ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0})𝑤 ≤ sup((ran 𝑘 ∪ {0}), ℝ, < )))
156	143, 155	mpbird 257	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → sup((ran (𝑥 ∈ 𝐼 ↦ ((𝑓‘𝑥)𝐸(𝑔‘𝑥))) ∪ {0}), ℝ^*, < ) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
157	84, 156	eqbrtrd 5132	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))
158		elicc2 13379	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ) → ((𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ ((𝑓𝐷𝑔) ∈ ℝ ∧ 0 ≤ (𝑓𝐷𝑔) ∧ (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))))
159	101, 152, 158	sylancr 587	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ((𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ ((𝑓𝐷𝑔) ∈ ℝ ∧ 0 ≤ (𝑓𝐷𝑔) ∧ (𝑓𝐷𝑔) ≤ sup((ran 𝑘 ∪ {0}), ℝ, < ))))
160	71, 73, 157, 159	mpbir3and 1343	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
161	160	an32s 652	. . . . . 6 ⊢ (((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) ∧ (𝑓 ∈ 𝐵 ∧ 𝑔 ∈ 𝐵)) → (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
162	161	ralrimivva 3181	. . . . 5 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
163		ffnov 7518	. . . . 5 ⊢ (𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )) ↔ (𝐷 Fn (𝐵 × 𝐵) ∧ ∀𝑓 ∈ 𝐵 ∀𝑔 ∈ 𝐵 (𝑓𝐷𝑔) ∈ (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))))
164	64, 162, 163	sylanbrc 583	. . . 4 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
165		oveq2 7398	. . . . . 6 ⊢ (𝑚 = sup((ran 𝑘 ∪ {0}), ℝ, < ) → (0[,]𝑚) = (0[,]sup((ran 𝑘 ∪ {0}), ℝ, < )))
166	165	feq3d 6676	. . . . 5 ⊢ (𝑚 = sup((ran 𝑘 ∪ {0}), ℝ, < ) → (𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚) ↔ 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))))
167	166	rspcev 3591	. . . 4 ⊢ ((sup((ran 𝑘 ∪ {0}), ℝ, < ) ∈ ℝ ∧ 𝐷:(𝐵 × 𝐵)⟶(0[,]sup((ran 𝑘 ∪ {0}), ℝ, < ))) → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
168	60, 164, 167	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ (𝑘:𝐼⟶ℝ ∧ ∀𝑥 ∈ 𝐼 𝐸:(𝑉 × 𝑉)⟶(0[,](𝑘‘𝑥)))) → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
169	34, 168	exlimddv 1935	. 2 ⊢ (𝜑 → ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚))
170		isbnd3 37785	. 2 ⊢ (𝐷 ∈ (Bnd‘𝐵) ↔ (𝐷 ∈ (Met‘𝐵) ∧ ∃𝑚 ∈ ℝ 𝐷:(𝐵 × 𝐵)⟶(0[,]𝑚)))
171	26, 169, 170	sylanbrc 583	1 ⊢ (𝜑 → 𝐷 ∈ (Bnd‘𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ≠ wne 2926 ∀wral 3045 ∃wrex 3054 Vcvv 3450 ∪ cun 3915 ⊆ wss 3917 ∅c0 4299 {csn 4592 class class class wbr 5110 ↦ cmpt 5191 Or wor 5548 × cxp 5639 ran crn 5642 ↾ cres 5643 Fn wfn 6509 ⟶wf 6510 –onto→wfo 6512 ‘cfv 6514 (class class class)co 7390 Fincfn 8921 supcsup 9398 ℝcr 11074 0cc0 11075 ℝ^*cxr 11214 < clt 11215 ≤ cle 11216 [,]cicc 13316 Basecbs 17186 distcds 17236 X_scprds 17415 Metcmet 21257 Bndcbnd 37768

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-pre-sup 11153

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-ec 8676 df-map 8804 df-ixp 8874 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9400 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-nn 12194 df-2 12256 df-3 12257 df-4 12258 df-5 12259 df-6 12260 df-7 12261 df-8 12262 df-9 12263 df-n0 12450 df-z 12537 df-dec 12657 df-uz 12801 df-rp 12959 df-xneg 13079 df-xadd 13080 df-xmul 13081 df-icc 13320 df-fz 13476 df-struct 17124 df-slot 17159 df-ndx 17171 df-base 17187 df-plusg 17240 df-mulr 17241 df-sca 17243 df-vsca 17244 df-ip 17245 df-tset 17246 df-ple 17247 df-ds 17249 df-hom 17251 df-cco 17252 df-prds 17417 df-psmet 21263 df-xmet 21264 df-met 21265 df-bl 21266 df-bnd 37780

This theorem is referenced by: (None)

W3C validator