Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  stoweidlem18 Structured version   Visualization version   GIF version

Theorem stoweidlem18 44249
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
StepHypRef Expression
1 stoweidlem18.3 . . 3 𝐹 = (𝑡𝑇 ↦ 1)
2 1re 11155 . . . 4 1 ∈ ℝ
3 stoweidlem18.5 . . . . 5 ((𝜑𝑎 ∈ ℝ) → (𝑡𝑇𝑎) ∈ 𝐴)
43stoweidlem4 44235 . . . 4 ((𝜑 ∧ 1 ∈ ℝ) → (𝑡𝑇 ↦ 1) ∈ 𝐴)
52, 4mpan2 689 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) ∈ 𝐴)
61, 5eqeltrid 2842 . 2 (𝜑𝐹𝐴)
7 stoweidlem18.2 . . 3 𝑡𝜑
8 0le1 11678 . . . . . 6 0 ≤ 1
9 simpr 485 . . . . . . 7 ((𝜑𝑡𝑇) → 𝑡𝑇)
101fvmpt2 6959 . . . . . . 7 ((𝑡𝑇 ∧ 1 ∈ ℝ) → (𝐹𝑡) = 1)
119, 2, 10sylancl 586 . . . . . 6 ((𝜑𝑡𝑇) → (𝐹𝑡) = 1)
128, 11breqtrrid 5143 . . . . 5 ((𝜑𝑡𝑇) → 0 ≤ (𝐹𝑡))
13 1le1 11783 . . . . . 6 1 ≤ 1
1411, 13eqbrtrdi 5144 . . . . 5 ((𝜑𝑡𝑇) → (𝐹𝑡) ≤ 1)
1512, 14jca 512 . . . 4 ((𝜑𝑡𝑇) → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
1615ex 413 . . 3 (𝜑 → (𝑡𝑇 → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
177, 16ralrimi 3240 . 2 (𝜑 → ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
18 stoweidlem18.8 . . 3 (𝜑𝐷 = ∅)
19 stoweidlem18.1 . . . . 5 𝑡𝐷
20 nfcv 2907 . . . . 5 𝑡
2119, 20nfeq 2920 . . . 4 𝑡 𝐷 = ∅
2221rzalf 43212 . . 3 (𝐷 = ∅ → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
2318, 22syl 17 . 2 (𝜑 → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
24 1red 11156 . . . . . . 7 (𝜑 → 1 ∈ ℝ)
25 stoweidlem18.7 . . . . . . 7 (𝜑𝐸 ∈ ℝ+)
2624, 25ltsubrpd 12989 . . . . . 6 (𝜑 → (1 − 𝐸) < 1)
2726adantr 481 . . . . 5 ((𝜑𝑡𝐵) → (1 − 𝐸) < 1)
28 stoweidlem18.6 . . . . . . . 8 (𝜑𝐵 ∈ (Clsd‘𝐽))
29 stoweidlem18.4 . . . . . . . . 9 𝑇 = 𝐽
3029cldss 22380 . . . . . . . 8 (𝐵 ∈ (Clsd‘𝐽) → 𝐵𝑇)
3128, 30syl 17 . . . . . . 7 (𝜑𝐵𝑇)
3231sselda 3944 . . . . . 6 ((𝜑𝑡𝐵) → 𝑡𝑇)
3332, 2, 10sylancl 586 . . . . 5 ((𝜑𝑡𝐵) → (𝐹𝑡) = 1)
3427, 33breqtrrd 5133 . . . 4 ((𝜑𝑡𝐵) → (1 − 𝐸) < (𝐹𝑡))
3534ex 413 . . 3 (𝜑 → (𝑡𝐵 → (1 − 𝐸) < (𝐹𝑡)))
367, 35ralrimi 3240 . 2 (𝜑 → ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))
37 nfcv 2907 . . . . . 6 𝑡𝑥
38 nfmpt1 5213 . . . . . . 7 𝑡(𝑡𝑇 ↦ 1)
391, 38nfcxfr 2905 . . . . . 6 𝑡𝐹
4037, 39nfeq 2920 . . . . 5 𝑡 𝑥 = 𝐹
41 fveq1 6841 . . . . . . 7 (𝑥 = 𝐹 → (𝑥𝑡) = (𝐹𝑡))
4241breq2d 5117 . . . . . 6 (𝑥 = 𝐹 → (0 ≤ (𝑥𝑡) ↔ 0 ≤ (𝐹𝑡)))
4341breq1d 5115 . . . . . 6 (𝑥 = 𝐹 → ((𝑥𝑡) ≤ 1 ↔ (𝐹𝑡) ≤ 1))
4442, 43anbi12d 631 . . . . 5 (𝑥 = 𝐹 → ((0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4540, 44ralbid 3256 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4641breq1d 5115 . . . . 5 (𝑥 = 𝐹 → ((𝑥𝑡) < 𝐸 ↔ (𝐹𝑡) < 𝐸))
4740, 46ralbid 3256 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐷 (𝑥𝑡) < 𝐸 ↔ ∀𝑡𝐷 (𝐹𝑡) < 𝐸))
4841breq2d 5117 . . . . 5 (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥𝑡) ↔ (1 − 𝐸) < (𝐹𝑡)))
4940, 48ralbid 3256 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡) ↔ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡)))
5045, 47, 493anbi123d 1436 . . 3 (𝑥 = 𝐹 → ((∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)) ↔ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))))
5150rspcev 3581 . 2 ((𝐹𝐴 ∧ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))) → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
526, 17, 23, 36, 51syl13anc 1372 1 (𝜑 → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wnf 1785  wcel 2106  wnfc 2887  wral 3064  wrex 3073  wss 3910  c0 4282   cuni 4865   class class class wbr 5105  cmpt 5188  cfv 6496  (class class class)co 7357  cr 11050  0cc0 11051  1c1 11052   < clt 11189  cle 11190  cmin 11385  +crp 12915  Clsdccld 22367
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-po 5545  df-so 5546  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-er 8648  df-en 8884  df-dom 8885  df-sdom 8886  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-rp 12916  df-top 22243  df-cld 22370
This theorem is referenced by:  stoweidlem58  44289
  Copyright terms: Public domain W3C validator