icoopnst - Metamath Proof Explorer

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

Theorem icoopnst 25063

Description: A half-open interval starting at 𝐴 is open in the closed interval from 𝐴 to 𝐵. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 15-Dec-2013.)

**Hypothesis**
Ref	Expression
icoopnst.1	⊢ 𝐽 = (MetOpen‘((abs ∘ − ) ↾ ((𝐴[,]𝐵) × (𝐴[,]𝐵))))

**Assertion**
Ref	Expression
icoopnst	⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) → (𝐴[,)𝐶) ∈ 𝐽))

Proof of Theorem icoopnst Dummy variable 𝑣 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		iooretop 24887	. . . . 5 ⊢ ((𝐴 − 1)(,)𝐶) ∈ (topGen‘ran (,))
2		simp1 1152	. . . . . . . . . . 11 ⊢ ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ∈ ℝ)
3	2	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ∈ ℝ))
4		ltm1 12053	. . . . . . . . . . . . . . . 16 ⊢ (𝐴 ∈ ℝ → (𝐴 − 1) < 𝐴)
5	4	adantr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝐴 − 1) < 𝐴)
6		peano2rem 11521	. . . . . . . . . . . . . . . . 17 ⊢ (𝐴 ∈ ℝ → (𝐴 − 1) ∈ ℝ)
7	6	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝐴 − 1) ∈ ℝ)
8		ltletr 11298	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐴 − 1) ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (((𝐴 − 1) < 𝐴 ∧ 𝐴 ≤ 𝑣) → (𝐴 − 1) < 𝑣))
9	8	3expb 1136	. . . . . . . . . . . . . . . 16 ⊢ (((𝐴 − 1) ∈ ℝ ∧ (𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ)) → (((𝐴 − 1) < 𝐴 ∧ 𝐴 ≤ 𝑣) → (𝐴 − 1) < 𝑣))
10	7, 9	mpancom 700	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (((𝐴 − 1) < 𝐴 ∧ 𝐴 ≤ 𝑣) → (𝐴 − 1) < 𝑣))
11	5, 10	mpand 707	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ ∧ 𝑣 ∈ ℝ) → (𝐴 ≤ 𝑣 → (𝐴 − 1) < 𝑣))
12	11	impr 459	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣)) → (𝐴 − 1) < 𝑣)
13	12	3adantr3 1188	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶)) → (𝐴 − 1) < 𝑣)
14	13	ex 417	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → (𝐴 − 1) < 𝑣))
15	14	ad2antrr 738	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → (𝐴 − 1) < 𝑣))
16		simp3 1154	. . . . . . . . . . 11 ⊢ ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 < 𝐶)
17	16	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 < 𝐶))
18	3, 15, 17	3jcad 1145	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → (𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶)))
19		simp2 1153	. . . . . . . . . . 11 ⊢ ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝐴 ≤ 𝑣)
20	19	a1i 11	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝐴 ≤ 𝑣))
21		rexr 11251	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ^*)
22		elioc2 13432	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)))
23	21, 22	sylan 591	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) ↔ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)))
24	23	biimpa 481	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵))
25		ltleletr 11299	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑣 ∈ ℝ ∧ 𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝑣 < 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝑣 ≤ 𝐵))
26	25	3expa 1134	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑣 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝐵 ∈ ℝ) → ((𝑣 < 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝑣 ≤ 𝐵))
27	26	an31s 666	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝑣 ∈ ℝ) → ((𝑣 < 𝐶 ∧ 𝐶 ≤ 𝐵) → 𝑣 ≤ 𝐵))
28	27	imp 411	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝑣 ∈ ℝ) ∧ (𝑣 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → 𝑣 ≤ 𝐵)
29	28	ancom2s 662	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝑣 ∈ ℝ) ∧ (𝐶 ≤ 𝐵 ∧ 𝑣 < 𝐶)) → 𝑣 ≤ 𝐵)
30	29	an4s 672	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝐶 ≤ 𝐵) ∧ (𝑣 ∈ ℝ ∧ 𝑣 < 𝐶)) → 𝑣 ≤ 𝐵)
31	30	3adantr2 1187	. . . . . . . . . . . . . . 15 ⊢ ((((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝐶 ≤ 𝐵) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶)) → 𝑣 ≤ 𝐵)
32	31	ex 417	. . . . . . . . . . . . . 14 ⊢ (((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) ∧ 𝐶 ≤ 𝐵) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ≤ 𝐵))
33	32	anasss 471	. . . . . . . . . . . . 13 ⊢ ((𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 𝐶 ≤ 𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ≤ 𝐵))
34	33	3adantr2 1187	. . . . . . . . . . . 12 ⊢ ((𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ≤ 𝐵))
35	34	adantll 726	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ (𝐶 ∈ ℝ ∧ 𝐴 < 𝐶 ∧ 𝐶 ≤ 𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ≤ 𝐵))
36	24, 35	syldan 602	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → 𝑣 ≤ 𝐵))
37	3, 20, 36	3jcad 1145	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)))
38	18, 37	jcad 521	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) → ((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵))))
39		simpl1 1208	. . . . . . . . 9 ⊢ (((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)) → 𝑣 ∈ ℝ)
40		simpr2 1212	. . . . . . . . 9 ⊢ (((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)) → 𝐴 ≤ 𝑣)
41		simpl3 1210	. . . . . . . . 9 ⊢ (((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)) → 𝑣 < 𝐶)
42	39, 40, 41	3jca 1144	. . . . . . . 8 ⊢ (((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)) → (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶))
43	38, 42	impbid1 228	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶) ↔ ((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵))))
44		simpll 778	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → 𝐴 ∈ ℝ)
45	24	simp1d 1158	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → 𝐶 ∈ ℝ)
46	45	rexrd 11255	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → 𝐶 ∈ ℝ^*)
47		elico2 13433	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ^*) → (𝑣 ∈ (𝐴[,)𝐶) ↔ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶)))
48	44, 46, 47	syl2anc 595	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝑣 ∈ (𝐴[,)𝐶) ↔ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 < 𝐶)))
49		elin 3929	. . . . . . . 8 ⊢ (𝑣 ∈ (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵)) ↔ (𝑣 ∈ ((𝐴 − 1)(,)𝐶) ∧ 𝑣 ∈ (𝐴[,]𝐵)))
50	6	rexrd 11255	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → (𝐴 − 1) ∈ ℝ^*)
51	50	ad2antrr 738	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐴 − 1) ∈ ℝ^*)
52		elioo2 13409	. . . . . . . . . 10 ⊢ (((𝐴 − 1) ∈ ℝ^* ∧ 𝐶 ∈ ℝ^*) → (𝑣 ∈ ((𝐴 − 1)(,)𝐶) ↔ (𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶)))
53	51, 46, 52	syl2anc 595	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝑣 ∈ ((𝐴 − 1)(,)𝐶) ↔ (𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶)))
54		elicc2 13434	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝑣 ∈ (𝐴[,]𝐵) ↔ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)))
55	54	adantr 485	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝑣 ∈ (𝐴[,]𝐵) ↔ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵)))
56	53, 55	anbi12d 643	. . . . . . . 8 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ((𝑣 ∈ ((𝐴 − 1)(,)𝐶) ∧ 𝑣 ∈ (𝐴[,]𝐵)) ↔ ((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵))))
57	49, 56	bitrid 286	. . . . . . 7 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝑣 ∈ (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵)) ↔ ((𝑣 ∈ ℝ ∧ (𝐴 − 1) < 𝑣 ∧ 𝑣 < 𝐶) ∧ (𝑣 ∈ ℝ ∧ 𝐴 ≤ 𝑣 ∧ 𝑣 ≤ 𝐵))))
58	43, 48, 57	3bitr4d 314	. . . . . 6 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝑣 ∈ (𝐴[,)𝐶) ↔ 𝑣 ∈ (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵))))
59	58	eqrdv 2767	. . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐴[,)𝐶) = (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵)))
60		ineq1 4174	. . . . . 6 ⊢ (𝑣 = ((𝐴 − 1)(,)𝐶) → (𝑣 ∩ (𝐴[,]𝐵)) = (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵)))
61	60	rspceeqv 3613	. . . . 5 ⊢ ((((𝐴 − 1)(,)𝐶) ∈ (topGen‘ran (,)) ∧ (𝐴[,)𝐶) = (((𝐴 − 1)(,)𝐶) ∩ (𝐴[,]𝐵))) → ∃𝑣 ∈ (topGen‘ran (,))(𝐴[,)𝐶) = (𝑣 ∩ (𝐴[,]𝐵)))
62	1, 59, 61	sylancr 598	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → ∃𝑣 ∈ (topGen‘ran (,))(𝐴[,)𝐶) = (𝑣 ∩ (𝐴[,]𝐵)))
63		retop 24883	. . . . 5 ⊢ (topGen‘ran (,)) ∈ Top
64		ovex 7441	. . . . 5 ⊢ (𝐴[,]𝐵) ∈ V
65		elrest 17476	. . . . 5 ⊢ (((topGen‘ran (,)) ∈ Top ∧ (𝐴[,]𝐵) ∈ V) → ((𝐴[,)𝐶) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ↔ ∃𝑣 ∈ (topGen‘ran (,))(𝐴[,)𝐶) = (𝑣 ∩ (𝐴[,]𝐵))))
66	63, 64, 65	mp2an 704	. . . 4 ⊢ ((𝐴[,)𝐶) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)) ↔ ∃𝑣 ∈ (topGen‘ran (,))(𝐴[,)𝐶) = (𝑣 ∩ (𝐴[,]𝐵)))
67	62, 66	sylibr 237	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐴[,)𝐶) ∈ ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
68		iccssre 13452	. . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴[,]𝐵) ⊆ ℝ)
69	68	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐴[,]𝐵) ⊆ ℝ)
70		eqid 2769	. . . . 5 ⊢ (topGen‘ran (,)) = (topGen‘ran (,))
71		icoopnst.1	. . . . 5 ⊢ 𝐽 = (MetOpen‘((abs ∘ − ) ↾ ((𝐴[,]𝐵) × (𝐴[,]𝐵))))
72	70, 71	resubmet 24924	. . . 4 ⊢ ((𝐴[,]𝐵) ⊆ ℝ → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
73	69, 72	syl 18	. . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → 𝐽 = ((topGen‘ran (,)) ↾_t (𝐴[,]𝐵)))
74	67, 73	eleqtrrd 2872	. 2 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) ∧ 𝐶 ∈ (𝐴(,]𝐵)) → (𝐴[,)𝐶) ∈ 𝐽)
75	74	ex 417	1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 ∈ (𝐴(,]𝐵) → (𝐴[,)𝐶) ∈ 𝐽))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 Vcvv 3463 ∩ cin 3912 ⊆ wss 3913 class class class wbr 5110 × cxp 5657 ran crn 5660 ↾ cres 5661 ∘ ccom 5663 ‘cfv 6533 (class class class)co 7408 ℝcr 11095 1c1 11097 ℝ^*cxr 11238 < clt 11239 ≤ cle 11240 − cmin 11437 (,)cioo 13368 (,]cioc 13369 [,)cico 13370 [,]cicc 13371 abscabs 15281 ↾_t crest 17469 topGenctg 17486 MetOpencmopn 21477 Topctop 23015

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5239 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-sup 9398 df-inf 9399 df-pnf 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-z 12588 df-uz 12859 df-q 12969 df-rp 13013 df-xneg 13133 df-xadd 13134 df-xmul 13135 df-ioo 13372 df-ioc 13373 df-ico 13374 df-icc 13375 df-seq 14034 df-exp 14094 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-rest 17471 df-topgen 17492 df-psmet 21479 df-xmet 21480 df-met 21481 df-bl 21482 df-mopn 21483 df-top 23016 df-topon 23033 df-bases 23068

This theorem is referenced by: (None)

W3C validator