Theorem stoweidlem41 46854

Description: This lemma is used to prove that there exists x as in Lemma 1 of [BrosowskiDeutsh] p. 90: 0 <= x(t) <= 1 for all t in T, x(t) < epsilon for all t in V, x(t) > 1 - epsilon for all t in T \ U. Here we prove the very last step of the proof of Lemma 1: "The result follows from taking x = 1 - q_n";. Here 𝐸 is used to represent ε in the paper, and 𝑦 to represent q_n in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem41.1	⊢ Ⅎ𝑡𝜑
stoweidlem41.2	⊢ 𝑋 = (𝑡 ∈ 𝑇 ↦ (1 − (𝑦‘𝑡)))
stoweidlem41.3	⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ 1)
stoweidlem41.4	⊢ 𝑉 ⊆ 𝑇
stoweidlem41.5	⊢ (𝜑 → 𝑦 ∈ 𝐴)
stoweidlem41.6	⊢ (𝜑 → 𝑦:𝑇⟶ℝ)
stoweidlem41.7	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
stoweidlem41.8	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem41.9	⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
stoweidlem41.10	⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑤) ∈ 𝐴)
stoweidlem41.11	⊢ (𝜑 → 𝐸 ∈ ℝ+)
stoweidlem41.12	⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1))
stoweidlem41.13	⊢ (𝜑 → ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡))
stoweidlem41.14	⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸)

Assertion

Ref	Expression
stoweidlem41	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑥‘𝑡)))

Distinct variable groups:   𝑓,𝑔,𝑡,𝑦   𝐴,𝑓,𝑔,𝑡   𝑓,𝐹,𝑔   𝑇,𝑓,𝑔,𝑡   𝜑,𝑓,𝑔   𝑤,𝑡,𝐴   𝑥,𝑡,𝐴   𝑤,𝑇   𝜑,𝑤   𝑥,𝐸   𝑥,𝑇   𝑥,𝑈   𝑥,𝑉   𝑥,𝑋

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑡)   𝐴(𝑦)   𝑇(𝑦)   𝑈(𝑦, 𝑤, 𝑡, 𝑓, 𝑔)   𝐸(𝑦, 𝑤, 𝑡, 𝑓, 𝑔)   𝐹(𝑥, 𝑦, 𝑤, 𝑡)   𝑉(𝑦, 𝑤, 𝑡, 𝑓, 𝑔)   𝑋(𝑦, 𝑤, 𝑡, 𝑓, 𝑔)

Proof of Theorem stoweidlem41

Step	Hyp	Ref	Expression
1		stoweidlem41.1	. . . . 5 ⊢ Ⅎ𝑡𝜑
2		1re 11233	. . . . . . . 8 ⊢ 1 ∈ ℝ
3		stoweidlem41.3	. . . . . . . . 9 ⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ 1)
4	3	fvmpt2 7002	. . . . . . . 8 ⊢ ((𝑡 ∈ 𝑇 ∧ 1 ∈ ℝ) → (𝐹‘𝑡) = 1)
5	2, 4	mpan2 704	. . . . . . 7 ⊢ (𝑡 ∈ 𝑇 → (𝐹‘𝑡) = 1)
6	5	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = 1)
7	6	oveq1d 7431	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → ((𝐹‘𝑡) − (𝑦‘𝑡)) = (1 − (𝑦‘𝑡)))
8	1, 7	mpteq2da 5201	. . . 4 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) − (𝑦‘𝑡))) = (𝑡 ∈ 𝑇 ↦ (1 − (𝑦‘𝑡))))
9		stoweidlem41.2	. . . 4 ⊢ 𝑋 = (𝑡 ∈ 𝑇 ↦ (1 − (𝑦‘𝑡)))
10	8, 9	eqtr4di 2815	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) − (𝑦‘𝑡))) = 𝑋)
11		stoweidlem41.10	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑤 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑤) ∈ 𝐴)
12	11	stoweidlem4 46817	. . . . . 6 ⊢ ((𝜑 ∧ 1 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
13	2, 12	mpan2 704	. . . . 5 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
14	3, 13	eqeltrid 2866	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
15		stoweidlem41.5	. . . 4 ⊢ (𝜑 → 𝑦 ∈ 𝐴)
16		nfmpt1 5208	. . . . . 6 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ 1)
17	3, 16	nfcxfr 2922	. . . . 5 ⊢ Ⅎ𝑡𝐹
18		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑡𝑦
19		stoweidlem41.7	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
20		stoweidlem41.8	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) + (𝑔‘𝑡))) ∈ 𝐴)
21		stoweidlem41.9	. . . . 5 ⊢ ((𝜑 ∧ 𝑓 ∈ 𝐴 ∧ 𝑔 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝑓‘𝑡) · (𝑔‘𝑡))) ∈ 𝐴)
22	17, 18, 1, 19, 20, 21, 11	stoweidlem33 46846	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) − (𝑦‘𝑡))) ∈ 𝐴)
23	14, 15, 22	mpd3an23 1492	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ ((𝐹‘𝑡) − (𝑦‘𝑡))) ∈ 𝐴)
24	10, 23	eqeltrrd 2863	. 2 ⊢ (𝜑 → 𝑋 ∈ 𝐴)
25		stoweidlem41.6	. . . . . . . 8 ⊢ (𝜑 → 𝑦:𝑇⟶ℝ)
26	25	ffvelcdmda 7080	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑦‘𝑡) ∈ ℝ)
27		1red 11234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 1 ∈ ℝ)
28		0red 11236	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ∈ ℝ)
29		stoweidlem41.12	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1))
30	29	r19.21bi 3256	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝑦‘𝑡) ∧ (𝑦‘𝑡) ≤ 1))
31	30	simprd 501	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑦‘𝑡) ≤ 1)
32		1m0e1 12385	. . . . . . . 8 ⊢ (1 − 0) = 1
33	31, 32	breqtrrdi 5151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑦‘𝑡) ≤ (1 − 0))
34	26, 27, 28, 33	lesubd 11843	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (1 − (𝑦‘𝑡)))
35		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
36	27, 26	resubcld 11667	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − (𝑦‘𝑡)) ∈ ℝ)
37	9	fvmpt2 7002	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ (1 − (𝑦‘𝑡)) ∈ ℝ) → (𝑋‘𝑡) = (1 − (𝑦‘𝑡)))
38	35, 36, 37	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑋‘𝑡) = (1 − (𝑦‘𝑡)))
39	34, 38	breqtrrd 5137	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝑋‘𝑡))
40	30	simpld 500	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝑦‘𝑡))
41	28, 26, 27, 40	lesub2dd 11856	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − (𝑦‘𝑡)) ≤ (1 − 0))
42	41, 32	breqtrdi 5150	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (1 − (𝑦‘𝑡)) ≤ 1)
43	38, 42	eqbrtrd 5131	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝑋‘𝑡) ≤ 1)
44	39, 43	jca 521	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1))
45	44	ex 418	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1)))
46	1, 45	ralrimi 3262	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1))
47		stoweidlem41.4	. . . . . . 7 ⊢ 𝑉 ⊆ 𝑇
48	47	sseli 3930	. . . . . 6 ⊢ (𝑡 ∈ 𝑉 → 𝑡 ∈ 𝑇)
49	48, 38	sylan2 605	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → (𝑋‘𝑡) = (1 − (𝑦‘𝑡)))
50		1red 11234	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → 1 ∈ ℝ)
51		stoweidlem41.11	. . . . . . . 8 ⊢ (𝜑 → 𝐸 ∈ ℝ+)
52	51	rpred 13086	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ)
53	52	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → 𝐸 ∈ ℝ)
54	48, 26	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → (𝑦‘𝑡) ∈ ℝ)
55		stoweidlem41.13	. . . . . . 7 ⊢ (𝜑 → ∀𝑡 ∈ 𝑉 (1 − 𝐸) < (𝑦‘𝑡))
56	55	r19.21bi 3256	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → (1 − 𝐸) < (𝑦‘𝑡))
57	50, 53, 54, 56	ltsub23d 11844	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → (1 − (𝑦‘𝑡)) < 𝐸)
58	49, 57	eqbrtrd 5131	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑉) → (𝑋‘𝑡) < 𝐸)
59	58	ex 418	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑉 → (𝑋‘𝑡) < 𝐸))
60	1, 59	ralrimi 3262	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑉 (𝑋‘𝑡) < 𝐸)
61		eldifi 4081	. . . . . . 7 ⊢ (𝑡 ∈ (𝑇 ∖ 𝑈) → 𝑡 ∈ 𝑇)
62	61, 26	sylan2 605	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (𝑦‘𝑡) ∈ ℝ)
63	52	adantr 486	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → 𝐸 ∈ ℝ)
64		1red 11234	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → 1 ∈ ℝ)
65		stoweidlem41.14	. . . . . . 7 ⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)(𝑦‘𝑡) < 𝐸)
66	65	r19.21bi 3256	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (𝑦‘𝑡) < 𝐸)
67	62, 63, 64, 66	ltsub2dd 11852	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (1 − 𝐸) < (1 − (𝑦‘𝑡)))
68	61, 38	sylan2 605	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (𝑋‘𝑡) = (1 − (𝑦‘𝑡)))
69	67, 68	breqtrrd 5137	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ (𝑇 ∖ 𝑈)) → (1 − 𝐸) < (𝑋‘𝑡))
70	69	ex 418	. . 3 ⊢ (𝜑 → (𝑡 ∈ (𝑇 ∖ 𝑈) → (1 − 𝐸) < (𝑋‘𝑡)))
71	1, 70	ralrimi 3262	. 2 ⊢ (𝜑 → ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑋‘𝑡))
72		nfmpt1 5208	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ (1 − (𝑦‘𝑡)))
73	9, 72	nfcxfr 2922	. . . . . 6 ⊢ Ⅎ𝑡𝑋
74	73	nfeq2 2941	. . . . 5 ⊢ Ⅎ𝑡 𝑥 = 𝑋
75		fveq1 6881	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥‘𝑡) = (𝑋‘𝑡))
76	75	breq2d 5119	. . . . . 6 ⊢ (𝑥 = 𝑋 → (0 ≤ (𝑥‘𝑡) ↔ 0 ≤ (𝑋‘𝑡)))
77	75	breq1d 5117	. . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑥‘𝑡) ≤ 1 ↔ (𝑋‘𝑡) ≤ 1))
78	76, 77	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝑋 → ((0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1)))
79	74, 78	ralbid 3277	. . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1)))
80	75	breq1d 5117	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥‘𝑡) < 𝐸 ↔ (𝑋‘𝑡) < 𝐸))
81	74, 80	ralbid 3277	. . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑡 ∈ 𝑉 (𝑥‘𝑡) < 𝐸 ↔ ∀𝑡 ∈ 𝑉 (𝑋‘𝑡) < 𝐸))
82	75	breq2d 5119	. . . . 5 ⊢ (𝑥 = 𝑋 → ((1 − 𝐸) < (𝑥‘𝑡) ↔ (1 − 𝐸) < (𝑋‘𝑡)))
83	74, 82	ralbid 3277	. . . 4 ⊢ (𝑥 = 𝑋 → (∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑥‘𝑡) ↔ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑋‘𝑡)))
84	79, 81, 83	3anbi123d 1464	. . 3 ⊢ (𝑥 = 𝑋 → ((∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑥‘𝑡)) ↔ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑋‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑋‘𝑡))))
85	84	rspcev 3579	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝑋‘𝑡) ∧ (𝑋‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑋‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑋‘𝑡))) → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑥‘𝑡)))
86	24, 46, 60, 71, 85	syl13anc 1399	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝑉 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ (𝑇 ∖ 𝑈)(1 − 𝐸) < (𝑥‘𝑡)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ∖ cdif 3899   ⊆ wss 3902   class class class wbr 5107   ↦ cmpt 5190  ⟶wf 6533  ‘cfv 6537  (class class class)co 7416  ℝcr 11124  0cc0 11125  1c1 11126   + caddc 11128   · cmul 11130   < clt 11268   ≤ cle 11269   − cmin 11466  ℝ⁺crp 13042

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-resscn 11182  ax-1cn 11183  ax-icn 11184  ax-addcl 11185  ax-addrcl 11186  ax-mulcl 11187  ax-mulrcl 11188  ax-mulcom 11189  ax-addass 11190  ax-mulass 11191  ax-distr 11192  ax-i2m1 11193  ax-1ne0 11194  ax-1rid 11195  ax-rnegex 11196  ax-rrecex 11197  ax-cnre 11198  ax-pre-lttri 11199  ax-pre-lttrn 11200  ax-pre-ltadd 11201

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  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-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11270  df-mnf 11271  df-xr 11272  df-ltxr 11273  df-le 11274  df-sub 11468  df-neg 11469  df-rp 13043

This theorem is used by:  stoweidlem52  46865