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 46833
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 11235 . . . 4 1 ∈ ℝ
3 stoweidlem18.5 . . . . 5 ((𝜑𝑎 ∈ ℝ) → (𝑡𝑇𝑎) ∈ 𝐴)
43stoweidlem4 46819 . . . 4 ((𝜑 ∧ 1 ∈ ℝ) → (𝑡𝑇 ↦ 1) ∈ 𝐴)
52, 4mpan2 704 . . 3 (𝜑 → (𝑡𝑇 ↦ 1) ∈ 𝐴)
61, 5eqeltrid 2866 . 2 (𝜑𝐹𝐴)
7 stoweidlem18.2 . . 3 𝑡𝜑
8 0le1 11764 . . . . . 6 0 ≤ 1
9 simpr 490 . . . . . . 7 ((𝜑𝑡𝑇) → 𝑡𝑇)
101fvmpt2 7002 . . . . . . 7 ((𝑡𝑇 ∧ 1 ∈ ℝ) → (𝐹𝑡) = 1)
119, 2, 10sylancl 598 . . . . . 6 ((𝜑𝑡𝑇) → (𝐹𝑡) = 1)
128, 11breqtrrid 5147 . . . . 5 ((𝜑𝑡𝑇) → 0 ≤ (𝐹𝑡))
13 1le1 11869 . . . . . 6 1 ≤ 1
1411, 13eqbrtrdi 5148 . . . . 5 ((𝜑𝑡𝑇) → (𝐹𝑡) ≤ 1)
1512, 14jca 521 . . . 4 ((𝜑𝑡𝑇) → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
1615ex 418 . . 3 (𝜑 → (𝑡𝑇 → (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
177, 16ralrimi 3262 . 2 (𝜑 → ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1))
18 stoweidlem18.8 . . 3 (𝜑𝐷 = ∅)
19 stoweidlem18.1 . . . . 5 𝑡𝐷
20 nfcv 2924 . . . . 5 𝑡
2119, 20nfeq 2937 . . . 4 𝑡 𝐷 = ∅
2221rzalf 45838 . . 3 (𝐷 = ∅ → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
2318, 22syl 18 . 2 (𝜑 → ∀𝑡𝐷 (𝐹𝑡) < 𝐸)
24 1red 11236 . . . . . . 7 (𝜑 → 1 ∈ ℝ)
25 stoweidlem18.7 . . . . . . 7 (𝜑𝐸 ∈ ℝ+)
2624, 25ltsubrpd 13120 . . . . . 6 (𝜑 → (1 − 𝐸) < 1)
2726adantr 486 . . . . 5 ((𝜑𝑡𝐵) → (1 − 𝐸) < 1)
28 stoweidlem18.6 . . . . . . . 8 (𝜑𝐵 ∈ (Clsd‘𝐽))
29 stoweidlem18.4 . . . . . . . . 9 𝑇 = 𝐽
3029cldss 23255 . . . . . . . 8 (𝐵 ∈ (Clsd‘𝐽) → 𝐵𝑇)
3128, 30syl 18 . . . . . . 7 (𝜑𝐵𝑇)
3231sselda 3934 . . . . . 6 ((𝜑𝑡𝐵) → 𝑡𝑇)
3332, 2, 10sylancl 598 . . . . 5 ((𝜑𝑡𝐵) → (𝐹𝑡) = 1)
3427, 33breqtrrd 5137 . . . 4 ((𝜑𝑡𝐵) → (1 − 𝐸) < (𝐹𝑡))
3534ex 418 . . 3 (𝜑 → (𝑡𝐵 → (1 − 𝐸) < (𝐹𝑡)))
367, 35ralrimi 3262 . 2 (𝜑 → ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))
37 nfcv 2924 . . . . . 6 𝑡𝑥
38 nfmpt1 5208 . . . . . . 7 𝑡(𝑡𝑇 ↦ 1)
391, 38nfcxfr 2922 . . . . . 6 𝑡𝐹
4037, 39nfeq 2937 . . . . 5 𝑡 𝑥 = 𝐹
41 fveq1 6881 . . . . . . 7 (𝑥 = 𝐹 → (𝑥𝑡) = (𝐹𝑡))
4241breq2d 5119 . . . . . 6 (𝑥 = 𝐹 → (0 ≤ (𝑥𝑡) ↔ 0 ≤ (𝐹𝑡)))
4341breq1d 5117 . . . . . 6 (𝑥 = 𝐹 → ((𝑥𝑡) ≤ 1 ↔ (𝐹𝑡) ≤ 1))
4442, 43anbi12d 644 . . . . 5 (𝑥 = 𝐹 → ((0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4540, 44ralbid 3277 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ↔ ∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1)))
4641breq1d 5117 . . . . 5 (𝑥 = 𝐹 → ((𝑥𝑡) < 𝐸 ↔ (𝐹𝑡) < 𝐸))
4740, 46ralbid 3277 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐷 (𝑥𝑡) < 𝐸 ↔ ∀𝑡𝐷 (𝐹𝑡) < 𝐸))
4841breq2d 5119 . . . . 5 (𝑥 = 𝐹 → ((1 − 𝐸) < (𝑥𝑡) ↔ (1 − 𝐸) < (𝐹𝑡)))
4940, 48ralbid 3277 . . . 4 (𝑥 = 𝐹 → (∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡) ↔ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡)))
5045, 47, 493anbi123d 1464 . . 3 (𝑥 = 𝐹 → ((∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)) ↔ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))))
5150rspcev 3579 . 2 ((𝐹𝐴 ∧ (∀𝑡𝑇 (0 ≤ (𝐹𝑡) ∧ (𝐹𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝐹𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝐹𝑡))) → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
526, 17, 23, 36, 51syl13anc 1399 1 (𝜑 → ∃𝑥𝐴 (∀𝑡𝑇 (0 ≤ (𝑥𝑡) ∧ (𝑥𝑡) ≤ 1) ∧ ∀𝑡𝐷 (𝑥𝑡) < 𝐸 ∧ ∀𝑡𝐵 (1 − 𝐸) < (𝑥𝑡)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wnf 1816  wcel 2145  wnfc 2909  wral 3078  wrex 3088  wss 3902  c0 4282   cuni 4870   class class class wbr 5107  cmpt 5190  cfv 6537  (class class class)co 7416  cr 11126  0cc0 11127  1c1 11128   < clt 11270  cle 11271  cmin 11468  +crp 13044  Clsdccld 23242
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739  ax-resscn 11184  ax-1cn 11185  ax-icn 11186  ax-addcl 11187  ax-addrcl 11188  ax-mulcl 11189  ax-mulrcl 11190  ax-mulcom 11191  ax-addass 11192  ax-mulass 11193  ax-distr 11194  ax-i2m1 11195  ax-1ne0 11196  ax-1rid 11197  ax-rnegex 11198  ax-rrecex 11199  ax-cnre 11200  ax-pre-lttri 11201  ax-pre-lttrn 11202  ax-pre-ltadd 11203  ax-pre-mulgt0 11204
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-nel 3064  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-po 5567  df-so 5568  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-er 8699  df-en 8956  df-dom 8957  df-sdom 8958  df-pnf 11272  df-mnf 11273  df-xr 11274  df-ltxr 11275  df-le 11276  df-sub 11470  df-neg 11471  df-rp 13045  df-top 23120  df-cld 23245
This theorem is used by:  stoweidlem58  46873
  Copyright terms: Public domain W3C validator