metucn - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > metucn		Structured version Visualization version GIF version

Theorem metucn 23178

Description: Uniform continuity in metric spaces. Compare the order of the quantifiers with metcn 23150. (Contributed by Thierry Arnoux, 26-Jan-2018.) (Revised by Thierry Arnoux, 11-Feb-2018.)

**Hypotheses**
Ref	Expression
metucn.u	⊢ 𝑈 = (metUnif‘𝐶)
metucn.v	⊢ 𝑉 = (metUnif‘𝐷)
metucn.x	⊢ (𝜑 → 𝑋 ≠ ∅)
metucn.y	⊢ (𝜑 → 𝑌 ≠ ∅)
metucn.c	⊢ (𝜑 → 𝐶 ∈ (PsMet‘𝑋))
metucn.d	⊢ (𝜑 → 𝐷 ∈ (PsMet‘𝑌))

**Assertion**
Ref	Expression
metucn	⊢ (𝜑 → (𝐹 ∈ (𝑈 Cn_u𝑉) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))))

Distinct variable groups: 𝑐,𝑑,𝑥,𝑦,𝐶 𝐷,𝑐,𝑑,𝑥,𝑦 𝐹,𝑐,𝑑,𝑥,𝑦 𝑥,𝑈,𝑦 𝑥,𝑉 𝑋,𝑐,𝑑,𝑥,𝑦 𝑌,𝑐,𝑑,𝑥,𝑦 𝜑,𝑐,𝑑,𝑥,𝑦 Allowed substitution hints: 𝑈(𝑐,𝑑) 𝑉(𝑦,𝑐,𝑑)

Proof of Theorem metucn Dummy variables 𝑎 𝑒 𝑢 𝑣 𝑏 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		metucn.u	. . . . . 6 ⊢ 𝑈 = (metUnif‘𝐶)
2		metucn.c	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ (PsMet‘𝑋))
3		metuval 23156	. . . . . . 7 ⊢ (𝐶 ∈ (PsMet‘𝑋) → (metUnif‘𝐶) = ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))))
4	2, 3	syl 17	. . . . . 6 ⊢ (𝜑 → (metUnif‘𝐶) = ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))))
5	1, 4	syl5eq 2845	. . . . 5 ⊢ (𝜑 → 𝑈 = ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))))
6		metucn.v	. . . . . 6 ⊢ 𝑉 = (metUnif‘𝐷)
7		metucn.d	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ (PsMet‘𝑌))
8		metuval 23156	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑌) → (metUnif‘𝐷) = ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))))
9	7, 8	syl 17	. . . . . 6 ⊢ (𝜑 → (metUnif‘𝐷) = ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))))
10	6, 9	syl5eq 2845	. . . . 5 ⊢ (𝜑 → 𝑉 = ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))))
11	5, 10	oveq12d 7153	. . . 4 ⊢ (𝜑 → (𝑈 Cn_u𝑉) = (((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) Cn_u((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))))))
12	11	eleq2d 2875	. . 3 ⊢ (𝜑 → (𝐹 ∈ (𝑈 Cn_u𝑉) ↔ 𝐹 ∈ (((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) Cn_u((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))))))
13		eqid 2798	. . . 4 ⊢ ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) = ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))))
14		eqid 2798	. . . 4 ⊢ ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))) = ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))))
15		metucn.x	. . . . 5 ⊢ (𝜑 → 𝑋 ≠ ∅)
16		oveq2 7143	. . . . . . . . 9 ⊢ (𝑎 = 𝑐 → (0[,)𝑎) = (0[,)𝑐))
17	16	imaeq2d 5896	. . . . . . . 8 ⊢ (𝑎 = 𝑐 → (^◡𝐶 “ (0[,)𝑎)) = (^◡𝐶 “ (0[,)𝑐)))
18	17	cbvmptv 5133	. . . . . . 7 ⊢ (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) = (𝑐 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑐)))
19	18	rneqi 5771	. . . . . 6 ⊢ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) = ran (𝑐 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑐)))
20	19	metust 23165	. . . . 5 ⊢ ((𝑋 ≠ ∅ ∧ 𝐶 ∈ (PsMet‘𝑋)) → ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) ∈ (UnifOn‘𝑋))
21	15, 2, 20	syl2anc 587	. . . 4 ⊢ (𝜑 → ((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) ∈ (UnifOn‘𝑋))
22		metucn.y	. . . . 5 ⊢ (𝜑 → 𝑌 ≠ ∅)
23		oveq2 7143	. . . . . . . . 9 ⊢ (𝑏 = 𝑑 → (0[,)𝑏) = (0[,)𝑑))
24	23	imaeq2d 5896	. . . . . . . 8 ⊢ (𝑏 = 𝑑 → (^◡𝐷 “ (0[,)𝑏)) = (^◡𝐷 “ (0[,)𝑑)))
25	24	cbvmptv 5133	. . . . . . 7 ⊢ (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) = (𝑑 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑑)))
26	25	rneqi 5771	. . . . . 6 ⊢ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) = ran (𝑑 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑑)))
27	26	metust 23165	. . . . 5 ⊢ ((𝑌 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑌)) → ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))) ∈ (UnifOn‘𝑌))
28	22, 7, 27	syl2anc 587	. . . 4 ⊢ (𝜑 → ((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))) ∈ (UnifOn‘𝑌))
29		oveq2 7143	. . . . . . . . 9 ⊢ (𝑎 = 𝑒 → (0[,)𝑎) = (0[,)𝑒))
30	29	imaeq2d 5896	. . . . . . . 8 ⊢ (𝑎 = 𝑒 → (^◡𝐶 “ (0[,)𝑎)) = (^◡𝐶 “ (0[,)𝑒)))
31	30	cbvmptv 5133	. . . . . . 7 ⊢ (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) = (𝑒 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑒)))
32	31	rneqi 5771	. . . . . 6 ⊢ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) = ran (𝑒 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑒)))
33	32	metustfbas 23164	. . . . 5 ⊢ ((𝑋 ≠ ∅ ∧ 𝐶 ∈ (PsMet‘𝑋)) → ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ∈ (fBas‘(𝑋 × 𝑋)))
34	15, 2, 33	syl2anc 587	. . . 4 ⊢ (𝜑 → ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ∈ (fBas‘(𝑋 × 𝑋)))
35		oveq2 7143	. . . . . . . . 9 ⊢ (𝑏 = 𝑓 → (0[,)𝑏) = (0[,)𝑓))
36	35	imaeq2d 5896	. . . . . . . 8 ⊢ (𝑏 = 𝑓 → (^◡𝐷 “ (0[,)𝑏)) = (^◡𝐷 “ (0[,)𝑓)))
37	36	cbvmptv 5133	. . . . . . 7 ⊢ (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) = (𝑓 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑓)))
38	37	rneqi 5771	. . . . . 6 ⊢ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) = ran (𝑓 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑓)))
39	38	metustfbas 23164	. . . . 5 ⊢ ((𝑌 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑌)) → ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ∈ (fBas‘(𝑌 × 𝑌)))
40	22, 7, 39	syl2anc 587	. . . 4 ⊢ (𝜑 → ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ∈ (fBas‘(𝑌 × 𝑌)))
41	13, 14, 21, 28, 34, 40	isucn2 22885	. . 3 ⊢ (𝜑 → (𝐹 ∈ (((𝑋 × 𝑋)filGenran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))) Cn_u((𝑌 × 𝑌)filGenran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))))) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)))))
42	12, 41	bitrd 282	. 2 ⊢ (𝜑 → (𝐹 ∈ (𝑈 Cn_u𝑉) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)))))
43		eqid 2798	. . . . . . . . . 10 ⊢ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑑))
44		oveq2 7143	. . . . . . . . . . . 12 ⊢ (𝑓 = 𝑑 → (0[,)𝑓) = (0[,)𝑑))
45	44	imaeq2d 5896	. . . . . . . . . . 11 ⊢ (𝑓 = 𝑑 → (^◡𝐷 “ (0[,)𝑓)) = (^◡𝐷 “ (0[,)𝑑)))
46	45	rspceeqv 3586	. . . . . . . . . 10 ⊢ ((𝑑 ∈ ℝ⁺ ∧ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑑))) → ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓)))
47	43, 46	mpan2 690	. . . . . . . . 9 ⊢ (𝑑 ∈ ℝ⁺ → ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓)))
48	47	adantl 485	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ ℝ⁺) → ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓)))
49	38	metustel 23157	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑌) → ((^◡𝐷 “ (0[,)𝑑)) ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ↔ ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓))))
50	7, 49	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((^◡𝐷 “ (0[,)𝑑)) ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ↔ ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓))))
51	50	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑑 ∈ ℝ⁺) → ((^◡𝐷 “ (0[,)𝑑)) ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ↔ ∃𝑓 ∈ ℝ⁺ (^◡𝐷 “ (0[,)𝑑)) = (^◡𝐷 “ (0[,)𝑓))))
52	48, 51	mpbird 260	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑑 ∈ ℝ⁺) → (^◡𝐷 “ (0[,)𝑑)) ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))))
53	26	metustel 23157	. . . . . . . 8 ⊢ (𝐷 ∈ (PsMet‘𝑌) → (𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ↔ ∃𝑑 ∈ ℝ⁺ 𝑣 = (^◡𝐷 “ (0[,)𝑑))))
54	7, 53	syl 17	. . . . . . 7 ⊢ (𝜑 → (𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏))) ↔ ∃𝑑 ∈ ℝ⁺ 𝑣 = (^◡𝐷 “ (0[,)𝑑))))
55		simpr 488	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑣 = (^◡𝐷 “ (0[,)𝑑))) → 𝑣 = (^◡𝐷 “ (0[,)𝑑)))
56	55	breqd 5041	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑣 = (^◡𝐷 “ (0[,)𝑑))) → ((𝐹‘𝑥)𝑣(𝐹‘𝑦) ↔ (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)))
57	56	imbi2d 344	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑣 = (^◡𝐷 “ (0[,)𝑑))) → ((𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
58	57	ralbidv 3162	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑣 = (^◡𝐷 “ (0[,)𝑑))) → (∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
59	58	rexralbidv 3260	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑣 = (^◡𝐷 “ (0[,)𝑑))) → (∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
60	52, 54, 59	ralxfr2d 5276	. . . . . 6 ⊢ (𝜑 → (∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
61		eqid 2798	. . . . . . . . . . 11 ⊢ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑐))
62		oveq2 7143	. . . . . . . . . . . . 13 ⊢ (𝑒 = 𝑐 → (0[,)𝑒) = (0[,)𝑐))
63	62	imaeq2d 5896	. . . . . . . . . . . 12 ⊢ (𝑒 = 𝑐 → (^◡𝐶 “ (0[,)𝑒)) = (^◡𝐶 “ (0[,)𝑐)))
64	63	rspceeqv 3586	. . . . . . . . . . 11 ⊢ ((𝑐 ∈ ℝ⁺ ∧ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑐))) → ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒)))
65	61, 64	mpan2 690	. . . . . . . . . 10 ⊢ (𝑐 ∈ ℝ⁺ → ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒)))
66	65	adantl 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑐 ∈ ℝ⁺) → ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒)))
67	32	metustel 23157	. . . . . . . . . . 11 ⊢ (𝐶 ∈ (PsMet‘𝑋) → ((^◡𝐶 “ (0[,)𝑐)) ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ↔ ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒))))
68	2, 67	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ((^◡𝐶 “ (0[,)𝑐)) ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ↔ ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒))))
69	68	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑐 ∈ ℝ⁺) → ((^◡𝐶 “ (0[,)𝑐)) ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ↔ ∃𝑒 ∈ ℝ⁺ (^◡𝐶 “ (0[,)𝑐)) = (^◡𝐶 “ (0[,)𝑒))))
70	66, 69	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑐 ∈ ℝ⁺) → (^◡𝐶 “ (0[,)𝑐)) ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))))
71	19	metustel 23157	. . . . . . . . 9 ⊢ (𝐶 ∈ (PsMet‘𝑋) → (𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ↔ ∃𝑐 ∈ ℝ⁺ 𝑢 = (^◡𝐶 “ (0[,)𝑐))))
72	2, 71	syl 17	. . . . . . . 8 ⊢ (𝜑 → (𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎))) ↔ ∃𝑐 ∈ ℝ⁺ 𝑢 = (^◡𝐶 “ (0[,)𝑐))))
73		simpr 488	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑢 = (^◡𝐶 “ (0[,)𝑐))) → 𝑢 = (^◡𝐶 “ (0[,)𝑐)))
74	73	breqd 5041	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑢 = (^◡𝐶 “ (0[,)𝑐))) → (𝑥𝑢𝑦 ↔ 𝑥(^◡𝐶 “ (0[,)𝑐))𝑦))
75	74	imbi1d 345	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑢 = (^◡𝐶 “ (0[,)𝑐))) → ((𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
76	75	2ralbidv 3164	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑢 = (^◡𝐶 “ (0[,)𝑐))) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
77	70, 72, 76	rexxfr2d 5277	. . . . . . 7 ⊢ (𝜑 → (∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
78	77	ralbidv 3162	. . . . . 6 ⊢ (𝜑 → (∀𝑑 ∈ ℝ⁺ ∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
79	60, 78	bitrd 282	. . . . 5 ⊢ (𝜑 → (∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
80	79	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → (∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦))))
81	2	ad4antr 731	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐶 ∈ (PsMet‘𝑋))
82		simplr 768	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑐 ∈ ℝ⁺)
83		simprr 772	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑦 ∈ 𝑋)
84		simprl 770	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑥 ∈ 𝑋)
85		elbl4 23170	. . . . . . . . . 10 ⊢ (((𝐶 ∈ (PsMet‘𝑋) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑥 ∈ (𝑦(ball‘𝐶)𝑐) ↔ 𝑥(^◡𝐶 “ (0[,)𝑐))𝑦))
86		rpxr 12386	. . . . . . . . . . 11 ⊢ (𝑐 ∈ ℝ⁺ → 𝑐 ∈ ℝ^*)
87		elbl3ps 22998	. . . . . . . . . . 11 ⊢ (((𝐶 ∈ (PsMet‘𝑋) ∧ 𝑐 ∈ ℝ^*) ∧ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑥 ∈ (𝑦(ball‘𝐶)𝑐) ↔ (𝑥𝐶𝑦) < 𝑐))
88	86, 87	sylanl2 680	. . . . . . . . . 10 ⊢ (((𝐶 ∈ (PsMet‘𝑋) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑥 ∈ (𝑦(ball‘𝐶)𝑐) ↔ (𝑥𝐶𝑦) < 𝑐))
89	85, 88	bitr3d 284	. . . . . . . . 9 ⊢ (((𝐶 ∈ (PsMet‘𝑋) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋)) → (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 ↔ (𝑥𝐶𝑦) < 𝑐))
90	81, 82, 83, 84, 89	syl22anc 837	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 ↔ (𝑥𝐶𝑦) < 𝑐))
91	7	ad4antr 731	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐷 ∈ (PsMet‘𝑌))
92		simpllr 775	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝑑 ∈ ℝ⁺)
93		simp-4r 783	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → 𝐹:𝑋⟶𝑌)
94	93, 83	ffvelrnd 6829	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑦) ∈ 𝑌)
95	93, 84	ffvelrnd 6829	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → (𝐹‘𝑥) ∈ 𝑌)
96		elbl4 23170	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ ((𝐹‘𝑦) ∈ 𝑌 ∧ (𝐹‘𝑥) ∈ 𝑌)) → ((𝐹‘𝑥) ∈ ((𝐹‘𝑦)(ball‘𝐷)𝑑) ↔ (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)))
97		rpxr 12386	. . . . . . . . . . 11 ⊢ (𝑑 ∈ ℝ⁺ → 𝑑 ∈ ℝ^*)
98		elbl3ps 22998	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑌) ∧ 𝑑 ∈ ℝ^*) ∧ ((𝐹‘𝑦) ∈ 𝑌 ∧ (𝐹‘𝑥) ∈ 𝑌)) → ((𝐹‘𝑥) ∈ ((𝐹‘𝑦)(ball‘𝐷)𝑑) ↔ ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))
99	97, 98	sylanl2 680	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ ((𝐹‘𝑦) ∈ 𝑌 ∧ (𝐹‘𝑥) ∈ 𝑌)) → ((𝐹‘𝑥) ∈ ((𝐹‘𝑦)(ball‘𝐷)𝑑) ↔ ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))
100	96, 99	bitr3d 284	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ ((𝐹‘𝑦) ∈ 𝑌 ∧ (𝐹‘𝑥) ∈ 𝑌)) → ((𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦) ↔ ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))
101	91, 92, 94, 95, 100	syl22anc 837	. . . . . . . 8 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦) ↔ ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))
102	90, 101	imbi12d 348	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋)) → ((𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑)))
103	102	2ralbidva 3163	. . . . . 6 ⊢ ((((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) ∧ 𝑐 ∈ ℝ⁺) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑)))
104	103	rexbidva 3255	. . . . 5 ⊢ (((𝜑 ∧ 𝐹:𝑋⟶𝑌) ∧ 𝑑 ∈ ℝ⁺) → (∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑)))
105	104	ralbidva 3161	. . . 4 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → (∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥(^◡𝐶 “ (0[,)𝑐))𝑦 → (𝐹‘𝑥)(^◡𝐷 “ (0[,)𝑑))(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑)))
106	80, 105	bitrd 282	. . 3 ⊢ ((𝜑 ∧ 𝐹:𝑋⟶𝑌) → (∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦)) ↔ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑)))
107	106	pm5.32da 582	. 2 ⊢ (𝜑 → ((𝐹:𝑋⟶𝑌 ∧ ∀𝑣 ∈ ran (𝑏 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑏)))∃𝑢 ∈ ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐶 “ (0[,)𝑎)))∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (𝑥𝑢𝑦 → (𝐹‘𝑥)𝑣(𝐹‘𝑦))) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))))
108	42, 107	bitrd 282	1 ⊢ (𝜑 → (𝐹 ∈ (𝑈 Cn_u𝑉) ↔ (𝐹:𝑋⟶𝑌 ∧ ∀𝑑 ∈ ℝ⁺ ∃𝑐 ∈ ℝ⁺ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐶𝑦) < 𝑐 → ((𝐹‘𝑥)𝐷(𝐹‘𝑦)) < 𝑑))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∀wral 3106 ∃wrex 3107 ∅c0 4243 class class class wbr 5030 ↦ cmpt 5110 × cxp 5517 ^◡ccnv 5518 ran crn 5520 “ cima 5522 ⟶wf 6320 ‘cfv 6324 (class class class)co 7135 0cc0 10526 ℝ^*cxr 10663 < clt 10664 ℝ⁺crp 12377 [,)cico 12728 PsMetcpsmet 20075 ballcbl 20078 fBascfbas 20079 filGencfg 20080 metUnifcmetu 20082 UnifOncust 22805 Cn_ucucn 22881

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-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

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-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 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-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-1st 7671 df-2nd 7672 df-er 8272 df-map 8391 df-en 8493 df-dom 8494 df-sdom 8495 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-2 11688 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-ico 12732 df-psmet 20083 df-bl 20086 df-fbas 20088 df-fg 20089 df-metu 20090 df-fil 22451 df-ust 22806 df-ucn 22882

This theorem is referenced by: qqhucn 31343 heicant 35092

W3C validator