Theorem stoweidlem18 42660

Description: This theorem proves Lemma 2 in [BrosowskiDeutsh] p. 92 when A is empty, the trivial case. Here D is used to denote the set A of Lemma 2, because the variable A is used for the subalgebra. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
stoweidlem18.1	⊢ Ⅎ𝑡𝐷
stoweidlem18.2	⊢ Ⅎ𝑡𝜑
stoweidlem18.3	⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ 1)
stoweidlem18.4	⊢ 𝑇 = ∪ 𝐽
stoweidlem18.5	⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑎) ∈ 𝐴)
stoweidlem18.6	⊢ (𝜑 → 𝐵 ∈ (Clsd‘𝐽))
stoweidlem18.7	⊢ (𝜑 → 𝐸 ∈ ℝ+)
stoweidlem18.8	⊢ (𝜑 → 𝐷 = ∅)

Assertion

Ref	Expression
stoweidlem18	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)))

Distinct variable groups:   𝑡,𝑎,𝑇   𝐴,𝑎   𝜑,𝑎   𝑥,𝑡   𝑥,𝐴   𝑥,𝐵   𝑥,𝐷   𝑥,𝐸   𝑥,𝐹   𝑥,𝑇

Allowed substitution hints:   𝜑(𝑥,𝑡)   𝐴(𝑡)   𝐵(𝑡,𝑎)   𝐷(𝑡,𝑎)   𝐸(𝑡,𝑎)   𝐹(𝑡,𝑎)   𝐽(𝑥,𝑡,𝑎)

Proof of Theorem stoweidlem18

Step	Hyp	Ref	Expression
1		stoweidlem18.3	. . 3 ⊢ 𝐹 = (𝑡 ∈ 𝑇 ↦ 1)
2		1re 10630	. . . 4 ⊢ 1 ∈ ℝ
3		stoweidlem18.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑎) ∈ 𝐴)
4	3	stoweidlem4 42646	. . . 4 ⊢ ((𝜑 ∧ 1 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
5	2, 4	mpan2 690	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
6	1, 5	eqeltrid 2894	. 2 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
7		stoweidlem18.2	. . 3 ⊢ Ⅎ𝑡𝜑
8		0le1 11152	. . . . . 6 ⊢ 0 ≤ 1
9		simpr 488	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
10	1	fvmpt2 6756	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ 1 ∈ ℝ) → (𝐹‘𝑡) = 1)
11	9, 2, 10	sylancl 589	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = 1)
12	8, 11	breqtrrid 5068	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝐹‘𝑡))
13		1le1 11257	. . . . . 6 ⊢ 1 ≤ 1
14	11, 13	eqbrtrdi 5069	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) ≤ 1)
15	12, 14	jca 515	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1))
16	15	ex 416	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
17	7, 16	ralrimi 3180	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1))
18		stoweidlem18.8	. . 3 ⊢ (𝜑 → 𝐷 = ∅)
19		stoweidlem18.1	. . . . 5 ⊢ Ⅎ𝑡𝐷
20		nfcv 2955	. . . . 5 ⊢ Ⅎ𝑡∅
21	19, 20	nfeq 2968	. . . 4 ⊢ Ⅎ𝑡 𝐷 = ∅
22	21	rzalf 41646	. . 3 ⊢ (𝐷 = ∅ → ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸)
23	18, 22	syl 17	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸)
24		1red 10631	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℝ)
25		stoweidlem18.7	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ+)
26	24, 25	ltsubrpd 12451	. . . . . 6 ⊢ (𝜑 → (1 − 𝐸) < 1)
27	26	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (1 − 𝐸) < 1)
28		stoweidlem18.6	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ (Clsd‘𝐽))
29		stoweidlem18.4	. . . . . . . . 9 ⊢ 𝑇 = ∪ 𝐽
30	29	cldss 21634	. . . . . . . 8 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐵 ⊆ 𝑇)
31	28, 30	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝑇)
32	31	sselda 3915	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → 𝑡 ∈ 𝑇)
33	32, 2, 10	sylancl 589	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (𝐹‘𝑡) = 1)
34	27, 33	breqtrrd 5058	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (1 − 𝐸) < (𝐹‘𝑡))
35	34	ex 416	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝐵 → (1 − 𝐸) < (𝐹‘𝑡)))
36	7, 35	ralrimi 3180	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))
37		nfcv 2955	. . . . . 6 ⊢ Ⅎ𝑡𝑥
38		nfmpt1 5128	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ 1)
39	1, 38	nfcxfr 2953	. . . . . 6 ⊢ Ⅎ𝑡𝐹
40	37, 39	nfeq 2968	. . . . 5 ⊢ Ⅎ𝑡 𝑥 = 𝐹
41		fveq1 6644	. . . . . . 7 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑡) = (𝐹‘𝑡))
42	41	breq2d 5042	. . . . . 6 ⊢ (𝑥 = 𝐹 → (0 ≤ (𝑥‘𝑡) ↔ 0 ≤ (𝐹‘𝑡)))
43	41	breq1d 5040	. . . . . 6 ⊢ (𝑥 = 𝐹 → ((𝑥‘𝑡) ≤ 1 ↔ (𝐹‘𝑡) ≤ 1))
44	42, 43	anbi12d 633	. . . . 5 ⊢ (𝑥 = 𝐹 → ((0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
45	40, 44	ralbid 3195	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
46	41	breq1d 5040	. . . . 5 ⊢ (𝑥 = 𝐹 → ((𝑥‘𝑡) < 𝐸 ↔ (𝐹‘𝑡) < 𝐸))
47	40, 46	ralbid 3195	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ↔ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸))
48	41	breq2d 5042	. . . . 5 ⊢ (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥‘𝑡) ↔ (1 − 𝐸) < (𝐹‘𝑡)))
49	40, 48	ralbid 3195	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡) ↔ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡)))
50	45, 47, 49	3anbi123d 1433	. . 3 ⊢ (𝑥 = 𝐹 → ((∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)) ↔ (∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))))
51	50	rspcev 3571	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))) → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)))
52	6, 17, 23, 36, 51	syl13anc 1369	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)))

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538  Ⅎwnf 1785   ∈ wcel 2111  Ⅎwnfc 2936  ∀wral 3106  ∃wrex 3107   ⊆ wss 3881  ∅c0 4243  ∪ cuni 4800   class class class wbr 5030   ↦ cmpt 5110  ‘cfv 6324  (class class class)co 7135  ℝcr 10525  0cc0 10526  1c1 10527   < clt 10664   ≤ cle 10665   − cmin 10859  ℝ⁺crp 12377  Clsdccld 21621

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-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-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-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-er 8272  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-rp 12378  df-top 21499  df-cld 21624

This theorem is referenced by:  stoweidlem58  42700