Theorem stoweidlem18 42323

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 10641	. . . 4 ⊢ 1 ∈ ℝ
3		stoweidlem18.5	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 𝑎) ∈ 𝐴)
4	3	stoweidlem4 42309	. . . 4 ⊢ ((𝜑 ∧ 1 ∈ ℝ) → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
5	2, 4	mpan2 689	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 ↦ 1) ∈ 𝐴)
6	1, 5	eqeltrid 2917	. 2 ⊢ (𝜑 → 𝐹 ∈ 𝐴)
7		stoweidlem18.2	. . 3 ⊢ Ⅎ𝑡𝜑
8		0le1 11163	. . . . . 6 ⊢ 0 ≤ 1
9		simpr 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 𝑡 ∈ 𝑇)
10	1	fvmpt2 6779	. . . . . . 7 ⊢ ((𝑡 ∈ 𝑇 ∧ 1 ∈ ℝ) → (𝐹‘𝑡) = 1)
11	9, 2, 10	sylancl 588	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) = 1)
12	8, 11	breqtrrid 5104	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → 0 ≤ (𝐹‘𝑡))
13		1le1 11268	. . . . . 6 ⊢ 1 ≤ 1
14	11, 13	eqbrtrdi 5105	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (𝐹‘𝑡) ≤ 1)
15	12, 14	jca 514	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝑇) → (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1))
16	15	ex 415	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝑇 → (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
17	7, 16	ralrimi 3216	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1))
18		stoweidlem18.8	. . 3 ⊢ (𝜑 → 𝐷 = ∅)
19		stoweidlem18.1	. . . . 5 ⊢ Ⅎ𝑡𝐷
20		nfcv 2977	. . . . 5 ⊢ Ⅎ𝑡∅
21	19, 20	nfeq 2991	. . . 4 ⊢ Ⅎ𝑡 𝐷 = ∅
22	21	rzalf 41294	. . 3 ⊢ (𝐷 = ∅ → ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸)
23	18, 22	syl 17	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸)
24		1red 10642	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℝ)
25		stoweidlem18.7	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ ℝ+)
26	24, 25	ltsubrpd 12464	. . . . . 6 ⊢ (𝜑 → (1 − 𝐸) < 1)
27	26	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (1 − 𝐸) < 1)
28		stoweidlem18.6	. . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ (Clsd‘𝐽))
29		stoweidlem18.4	. . . . . . . . 9 ⊢ 𝑇 = ∪ 𝐽
30	29	cldss 21637	. . . . . . . 8 ⊢ (𝐵 ∈ (Clsd‘𝐽) → 𝐵 ⊆ 𝑇)
31	28, 30	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐵 ⊆ 𝑇)
32	31	sselda 3967	. . . . . 6 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → 𝑡 ∈ 𝑇)
33	32, 2, 10	sylancl 588	. . . . 5 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (𝐹‘𝑡) = 1)
34	27, 33	breqtrrd 5094	. . . 4 ⊢ ((𝜑 ∧ 𝑡 ∈ 𝐵) → (1 − 𝐸) < (𝐹‘𝑡))
35	34	ex 415	. . 3 ⊢ (𝜑 → (𝑡 ∈ 𝐵 → (1 − 𝐸) < (𝐹‘𝑡)))
36	7, 35	ralrimi 3216	. 2 ⊢ (𝜑 → ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))
37		nfcv 2977	. . . . . 6 ⊢ Ⅎ𝑡𝑥
38		nfmpt1 5164	. . . . . . 7 ⊢ Ⅎ𝑡(𝑡 ∈ 𝑇 ↦ 1)
39	1, 38	nfcxfr 2975	. . . . . 6 ⊢ Ⅎ𝑡𝐹
40	37, 39	nfeq 2991	. . . . 5 ⊢ Ⅎ𝑡 𝑥 = 𝐹
41		fveq1 6669	. . . . . . 7 ⊢ (𝑥 = 𝐹 → (𝑥‘𝑡) = (𝐹‘𝑡))
42	41	breq2d 5078	. . . . . 6 ⊢ (𝑥 = 𝐹 → (0 ≤ (𝑥‘𝑡) ↔ 0 ≤ (𝐹‘𝑡)))
43	41	breq1d 5076	. . . . . 6 ⊢ (𝑥 = 𝐹 → ((𝑥‘𝑡) ≤ 1 ↔ (𝐹‘𝑡) ≤ 1))
44	42, 43	anbi12d 632	. . . . 5 ⊢ (𝑥 = 𝐹 → ((0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
45	40, 44	ralbid 3231	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1)))
46	41	breq1d 5076	. . . . 5 ⊢ (𝑥 = 𝐹 → ((𝑥‘𝑡) < 𝐸 ↔ (𝐹‘𝑡) < 𝐸))
47	40, 46	ralbid 3231	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ↔ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸))
48	41	breq2d 5078	. . . . 5 ⊢ (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥‘𝑡) ↔ (1 − 𝐸) < (𝐹‘𝑡)))
49	40, 48	ralbid 3231	. . . 4 ⊢ (𝑥 = 𝐹 → (∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡) ↔ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡)))
50	45, 47, 49	3anbi123d 1432	. . 3 ⊢ (𝑥 = 𝐹 → ((∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)) ↔ (∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))))
51	50	rspcev 3623	. 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (∀𝑡 ∈ 𝑇 (0 ≤ (𝐹‘𝑡) ∧ (𝐹‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝐹‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝐹‘𝑡))) → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)))
52	6, 17, 23, 36, 51	syl13anc 1368	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑡 ∈ 𝑇 (0 ≤ (𝑥‘𝑡) ∧ (𝑥‘𝑡) ≤ 1) ∧ ∀𝑡 ∈ 𝐷 (𝑥‘𝑡) < 𝐸 ∧ ∀𝑡 ∈ 𝐵 (1 − 𝐸) < (𝑥‘𝑡)))

Syntax hints:   → wi 4   ∧ wa 398   ∧ w3a 1083   = wceq 1537  Ⅎwnf 1784   ∈ wcel 2114  Ⅎwnfc 2961  ∀wral 3138  ∃wrex 3139   ⊆ wss 3936  ∅c0 4291  ∪ cuni 4838   class class class wbr 5066   ↦ cmpt 5146  ‘cfv 6355  (class class class)co 7156  ℝcr 10536  0cc0 10537  1c1 10538   < clt 10675   ≤ cle 10676   − cmin 10870  ℝ⁺crp 12390  Clsdccld 21624

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-po 5474  df-so 5475  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-er 8289  df-en 8510  df-dom 8511  df-sdom 8512  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-rp 12391  df-top 21502  df-cld 21627

This theorem is referenced by:  stoweidlem58  42363