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 46659
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 11208 . . . 4 1 ∈ ℝ
3 stoweidlem18.5 . . . . 5 ((𝜑𝑎 ∈ ℝ) → (𝑡𝑇𝑎) ∈ 𝐴)
43stoweidlem4 46645 . . . 4 ((𝜑 ∧ 1 ∈ ℝ) → (𝑡𝑇 ↦ 1) ∈ 𝐴)
52, 4mpan2 703 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) ∈ 𝐴)
61, 5eqeltrid 2873 . 2 (𝜑𝐹𝐴)
7 stoweidlem18.2 . . 3 𝑡𝜑
8 0le1 11737 . . . . . 6 0 ≤ 1
9 simpr 489 . . . . . . 7 ((𝜑𝑡𝑇) → 𝑡𝑇)
101fvmpt2 7002 . . . . . . 7 ((𝑡𝑇 ∧ 1 ∈ ℝ) → (𝐹𝑡) = 1)
119, 2, 10sylancl 597 . . . . . 6 ((𝜑𝑡𝑇) → (𝐹𝑡) = 1)
128, 11breqtrrid 5151 . . . . 5 ((𝜑𝑡𝑇) → 0 ≤ (𝐹𝑡))
13 1le1 11842 . . . . . 6 1 ≤ 1
1411, 13eqbrtrdi 5152 . . . . 5 ((𝜑𝑡𝑇) → (𝐹𝑡) ≤ 1)
1512, 14jca 520 . . . 4 ((𝜑𝑡𝑇) → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
1615ex 417 . . 3 (𝜑 → (𝑡𝑇 → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
177, 16ralrimi 3269 . 2 (𝜑 → ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
18 stoweidlem18.8 . . 3 (𝜑𝐷 = ∅)
19 stoweidlem18.1 . . . . 5 𝑡𝐷
20 nfcv 2931 . . . . 5 𝑡
2119, 20nfeq 2944 . . . 4 𝑡 𝐷 = ∅
2221rzalf 45664 . . 3 (𝐷 = ∅ → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
2318, 22syl 18 . 2 (𝜑 → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
24 1red 11209 . . . . . . 7 (𝜑 → 1 ∈ ℝ)
25 stoweidlem18.7 . . . . . . 7 (𝜑𝐸 ∈ ℝ+)
2624, 25ltsubrpd 13092 . . . . . 6 (𝜑 → (1 − 𝐸) < 1)
2726adantr 485 . . . . 5 ((𝜑𝑡𝐵) → (1 − 𝐸) < 1)
28 stoweidlem18.6 . . . . . . . 8 (𝜑𝐵 ∈ (Clsd‘𝐽))
29 stoweidlem18.4 . . . . . . . . 9 𝑇 = 𝐽
3029cldss 23155 . . . . . . . 8 (𝐵 ∈ (Clsd‘𝐽) → 𝐵𝑇)
3128, 30syl 18 . . . . . . 7 (𝜑𝐵𝑇)
3231sselda 3943 . . . . . 6 ((𝜑𝑡𝐵) → 𝑡𝑇)
3332, 2, 10sylancl 597 . . . . 5 ((𝜑𝑡𝐵) → (𝐹𝑡) = 1)
3427, 33breqtrrd 5141 . . . 4 ((𝜑𝑡𝐵) → (1 − 𝐸) < (𝐹𝑡))
3534ex 417 . . 3 (𝜑 → (𝑡𝐵 → (1 − 𝐸) < (𝐹𝑡)))
367, 35ralrimi 3269 . 2 (𝜑 → ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))
37 nfcv 2931 . . . . . 6 𝑡𝑥
38 nfmpt1 5212 . . . . . . 7 𝑡(𝑡𝑇 ↦ 1)
391, 38nfcxfr 2929 . . . . . 6 𝑡𝐹
4037, 39nfeq 2944 . . . . 5 𝑡 𝑥 = 𝐹
41 fveq1 6881 . . . . . . 7 (𝑥 = 𝐹 → (𝑥𝑡) = (𝐹𝑡))
4241breq2d 5123 . . . . . 6 (𝑥 = 𝐹 → (0 ≤ (𝑥𝑡) ↔ 0 ≤ (𝐹𝑡)))
4341breq1d 5121 . . . . . 6 (𝑥 = 𝐹 → ((𝑥𝑡) ≤ 1 ↔ (𝐹𝑡) ≤ 1))
4442, 43anbi12d 643 . . . . 5 (𝑥 = 𝐹 → ((0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4540, 44ralbid 3284 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4641breq1d 5121 . . . . 5 (𝑥 = 𝐹 → ((𝑥𝑡) < 𝐸 ↔ (𝐹𝑡) < 𝐸))
4740, 46ralbid 3284 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐷 (𝑥𝑡) < 𝐸 ↔ ∀𝑡𝐷 (𝐹𝑡) < 𝐸))
4841breq2d 5123 . . . . 5 (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥𝑡) ↔ (1 − 𝐸) < (𝐹𝑡)))
4940, 48ralbid 3284 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡) ↔ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡)))
5045, 47, 493anbi123d 1462 . . 3 (𝑥 = 𝐹 → ((∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)) ↔ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))))
5150rspcev 3588 . 2 ((𝐹𝐴 ∧ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))) → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
526, 17, 23, 36, 51syl13anc 1397 1 (𝜑 → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1101   = wceq 1567  wnf 1810  wcel 2149  wnfc 2916  wral 3085  wrex 3095  wss 3911  c0 4292   cuni 4874   class class class wbr 5111  cmpt 5194  cfv 6537  (class class class)co 7411  cr 11099  0cc0 11100  1c1 11101   < clt 11243  cle 11244  cmin 11441  +crp 13016  Clsdccld 23142
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-sep 5259  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177
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-reu 3376  df-rab 3423  df-v 3463  df-sbc 3752  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4293  df-if 4491  df-pw 4567  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5557  df-po 5570  df-so 5571  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-er 8694  df-en 8944  df-dom 8945  df-sdom 8946  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-rp 13017  df-top 23020  df-cld 23145
This theorem is referenced by:  stoweidlem58  46699
  Copyright terms: Public domain W3C validator