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 46468
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 11139 . . . 4 1 ∈ ℝ
3 stoweidlem18.5 . . . . 5 ((𝜑𝑎 ∈ ℝ) → (𝑡𝑇𝑎) ∈ 𝐴)
43stoweidlem4 46454 . . . 4 ((𝜑 ∧ 1 ∈ ℝ) → (𝑡𝑇 ↦ 1) ∈ 𝐴)
52, 4mpan2 692 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) ∈ 𝐴)
61, 5eqeltrid 2841 . 2 (𝜑𝐹𝐴)
7 stoweidlem18.2 . . 3 𝑡𝜑
8 0le1 11668 . . . . . 6 0 ≤ 1
9 simpr 484 . . . . . . 7 ((𝜑𝑡𝑇) → 𝑡𝑇)
101fvmpt2 6955 . . . . . . 7 ((𝑡𝑇 ∧ 1 ∈ ℝ) → (𝐹𝑡) = 1)
119, 2, 10sylancl 587 . . . . . 6 ((𝜑𝑡𝑇) → (𝐹𝑡) = 1)
128, 11breqtrrid 5124 . . . . 5 ((𝜑𝑡𝑇) → 0 ≤ (𝐹𝑡))
13 1le1 11773 . . . . . 6 1 ≤ 1
1411, 13eqbrtrdi 5125 . . . . 5 ((𝜑𝑡𝑇) → (𝐹𝑡) ≤ 1)
1512, 14jca 511 . . . 4 ((𝜑𝑡𝑇) → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
1615ex 412 . . 3 (𝜑 → (𝑡𝑇 → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
177, 16ralrimi 3236 . 2 (𝜑 → ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
18 stoweidlem18.8 . . 3 (𝜑𝐷 = ∅)
19 stoweidlem18.1 . . . . 5 𝑡𝐷
20 nfcv 2899 . . . . 5 𝑡
2119, 20nfeq 2913 . . . 4 𝑡 𝐷 = ∅
2221rzalf 45470 . . 3 (𝐷 = ∅ → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
2318, 22syl 17 . 2 (𝜑 → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
24 1red 11140 . . . . . . 7 (𝜑 → 1 ∈ ℝ)
25 stoweidlem18.7 . . . . . . 7 (𝜑𝐸 ∈ ℝ+)
2624, 25ltsubrpd 13013 . . . . . 6 (𝜑 → (1 − 𝐸) < 1)
2726adantr 480 . . . . 5 ((𝜑𝑡𝐵) → (1 − 𝐸) < 1)
28 stoweidlem18.6 . . . . . . . 8 (𝜑𝐵 ∈ (Clsd‘𝐽))
29 stoweidlem18.4 . . . . . . . . 9 𝑇 = 𝐽
3029cldss 23008 . . . . . . . 8 (𝐵 ∈ (Clsd‘𝐽) → 𝐵𝑇)
3128, 30syl 17 . . . . . . 7 (𝜑𝐵𝑇)
3231sselda 3922 . . . . . 6 ((𝜑𝑡𝐵) → 𝑡𝑇)
3332, 2, 10sylancl 587 . . . . 5 ((𝜑𝑡𝐵) → (𝐹𝑡) = 1)
3427, 33breqtrrd 5114 . . . 4 ((𝜑𝑡𝐵) → (1 − 𝐸) < (𝐹𝑡))
3534ex 412 . . 3 (𝜑 → (𝑡𝐵 → (1 − 𝐸) < (𝐹𝑡)))
367, 35ralrimi 3236 . 2 (𝜑 → ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))
37 nfcv 2899 . . . . . 6 𝑡𝑥
38 nfmpt1 5185 . . . . . . 7 𝑡(𝑡𝑇 ↦ 1)
391, 38nfcxfr 2897 . . . . . 6 𝑡𝐹
4037, 39nfeq 2913 . . . . 5 𝑡 𝑥 = 𝐹
41 fveq1 6835 . . . . . . 7 (𝑥 = 𝐹 → (𝑥𝑡) = (𝐹𝑡))
4241breq2d 5098 . . . . . 6 (𝑥 = 𝐹 → (0 ≤ (𝑥𝑡) ↔ 0 ≤ (𝐹𝑡)))
4341breq1d 5096 . . . . . 6 (𝑥 = 𝐹 → ((𝑥𝑡) ≤ 1 ↔ (𝐹𝑡) ≤ 1))
4442, 43anbi12d 633 . . . . 5 (𝑥 = 𝐹 → ((0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4540, 44ralbid 3251 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4641breq1d 5096 . . . . 5 (𝑥 = 𝐹 → ((𝑥𝑡) < 𝐸 ↔ (𝐹𝑡) < 𝐸))
4740, 46ralbid 3251 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐷 (𝑥𝑡) < 𝐸 ↔ ∀𝑡𝐷 (𝐹𝑡) < 𝐸))
4841breq2d 5098 . . . . 5 (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥𝑡) ↔ (1 − 𝐸) < (𝐹𝑡)))
4940, 48ralbid 3251 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡) ↔ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡)))
5045, 47, 493anbi123d 1439 . . 3 (𝑥 = 𝐹 → ((∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)) ↔ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))))
5150rspcev 3565 . 2 ((𝐹𝐴 ∧ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))) → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
526, 17, 23, 36, 51syl13anc 1375 1 (𝜑 → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1087   = wceq 1542  wnf 1785  wcel 2114  wnfc 2884  wral 3052  wrex 3062  wss 3890  c0 4274   cuni 4851   class class class wbr 5086  cmpt 5167  cfv 6494  (class class class)co 7362  cr 11032  0cc0 11033  1c1 11034   < clt 11174  cle 11175  cmin 11372  +crp 12937  Clsdccld 22995
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5304  ax-pr 5372  ax-un 7684  ax-resscn 11090  ax-1cn 11091  ax-icn 11092  ax-addcl 11093  ax-addrcl 11094  ax-mulcl 11095  ax-mulrcl 11096  ax-mulcom 11097  ax-addass 11098  ax-mulass 11099  ax-distr 11100  ax-i2m1 11101  ax-1ne0 11102  ax-1rid 11103  ax-rnegex 11104  ax-rrecex 11105  ax-cnre 11106  ax-pre-lttri 11107  ax-pre-lttrn 11108  ax-pre-ltadd 11109  ax-pre-mulgt0 11110
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5521  df-po 5534  df-so 5535  df-xp 5632  df-rel 5633  df-cnv 5634  df-co 5635  df-dm 5636  df-rn 5637  df-res 5638  df-ima 5639  df-iota 6450  df-fun 6496  df-fn 6497  df-f 6498  df-f1 6499  df-fo 6500  df-f1o 6501  df-fv 6502  df-riota 7319  df-ov 7365  df-oprab 7366  df-mpo 7367  df-er 8638  df-en 8889  df-dom 8890  df-sdom 8891  df-pnf 11176  df-mnf 11177  df-xr 11178  df-ltxr 11179  df-le 11180  df-sub 11374  df-neg 11375  df-rp 12938  df-top 22873  df-cld 22998
This theorem is referenced by:  stoweidlem58  46508
  Copyright terms: Public domain W3C validator