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

Theorem stoweidlem15 47359
Description: This lemma is used to prove the existence of a function 𝑝 as in Lemma 1 from [BrosowskiDeutsh] p. 90: 𝑝 is in the subalgebra, such that 0 ≤ p ≤ 1, p_(t0) = 0, and p > 0 on T - U. Here (𝐺‘𝐼) is used to represent p_(ti) in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)
Hypotheses
Ref Expression
stoweidlem15.1 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
stoweidlem15.3 (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
stoweidlem15.4 ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
Assertion
Ref Expression
stoweidlem15 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (((𝐺‘𝐼)‘𝑆) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
Distinct variable groups:   𝐴,𝑓   𝑓,𝐺   𝑓,𝐼   𝑇,𝑓   𝜑,𝑓   𝑡,ℎ,𝐺   𝐴,ℎ   ℎ,𝐼,𝑡   𝑇,ℎ,𝑡   ℎ,𝑍
Allowed substitution hints:   𝜑(𝑡, ℎ)   𝐴(𝑡)   𝑄(𝑡, 𝑓, ℎ)   𝑆(𝑡, 𝑓, ℎ)   𝑀(𝑡, 𝑓, ℎ)   𝑍(𝑡, 𝑓)

Proof of Theorem stoweidlem15
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 simpl 488 . . . 4 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → 𝜑)
2 stoweidlem15.3 . . . . . 6 (𝜑 → 𝐺:(1...𝑀)⟶𝑄)
32ffvelcdmda 7116 . . . . 5 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝑄)
4 elrabi 3644 . . . . . 6 ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} → (𝐺‘𝐼) ∈ 𝐴)
5 stoweidlem15.1 . . . . . 6 𝑄 = {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))}
64, 5eleq2s 2882 . . . . 5 ((𝐺‘𝐼) ∈ 𝑄 → (𝐺‘𝐼) ∈ 𝐴)
73, 6syl 18 . . . 4 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ 𝐴)
8 eleq1 2852 . . . . . . . 8 (𝑓 = (𝐺‘𝐼) → (𝑓 ∈ 𝐴 ↔ (𝐺‘𝐼) ∈ 𝐴))
98anbi2d 642 . . . . . . 7 (𝑓 = (𝐺‘𝐼) → ((𝜑 ∧ 𝑓 ∈ 𝐴) ↔ (𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴)))
10 feq1 6717 . . . . . . 7 (𝑓 = (𝐺‘𝐼) → (𝑓:𝑇⟶ℝ ↔ (𝐺‘𝐼):𝑇⟶ℝ))
119, 10imbi12d 347 . . . . . 6 (𝑓 = (𝐺‘𝐼) → (((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ) ↔ ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ)))
12 stoweidlem15.4 . . . . . 6 ((𝜑 ∧ 𝑓 ∈ 𝐴) → 𝑓:𝑇⟶ℝ)
1311, 12vtoclg 3521 . . . . 5 ((𝐺‘𝐼) ∈ 𝐴 → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
147, 13syl 18 . . . 4 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝜑 ∧ (𝐺‘𝐼) ∈ 𝐴) → (𝐺‘𝐼):𝑇⟶ℝ))
151, 7, 14mp2and 712 . . 3 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼):𝑇⟶ℝ)
1615ffvelcdmda 7116 . 2 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ∈ ℝ)
173, 5eleqtrdi 2874 . . . . . . 7 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))})
18 fveq1 6915 . . . . . . . . . 10 (ℎ = (𝐺‘𝐼) → (ℎ‘𝑍) = ((𝐺‘𝐼)‘𝑍))
1918eqeq1d 2765 . . . . . . . . 9 (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑍) = 0 ↔ ((𝐺‘𝐼)‘𝑍) = 0))
20 fveq1 6915 . . . . . . . . . . . 12 (ℎ = (𝐺‘𝐼) → (ℎ‘𝑡) = ((𝐺‘𝐼)‘𝑡))
2120breq2d 5120 . . . . . . . . . . 11 (ℎ = (𝐺‘𝐼) → (0 ≤ (ℎ‘𝑡) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
2220breq1d 5118 . . . . . . . . . . 11 (ℎ = (𝐺‘𝐼) → ((ℎ‘𝑡) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
2321, 22anbi12d 644 . . . . . . . . . 10 (ℎ = (𝐺‘𝐼) → ((0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
2423ralbidv 3189 . . . . . . . . 9 (ℎ = (𝐺‘𝐼) → (∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
2519, 24anbi12d 644 . . . . . . . 8 (ℎ = (𝐺‘𝐼) → (((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1)) ↔ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
2625elrab 3648 . . . . . . 7 ((𝐺‘𝐼) ∈ {ℎ ∈ 𝐴 ∣ ((ℎ‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ (ℎ‘𝑡) ∧ (ℎ‘𝑡) ≤ 1))} ↔ ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
2717, 26sylib 221 . . . . . 6 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ((𝐺‘𝐼) ∈ 𝐴 ∧ (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))))
2827simprd 501 . . . . 5 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → (((𝐺‘𝐼)‘𝑍) = 0 ∧ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
2928simprd 501 . . . 4 ((𝜑 ∧ 𝐼 ∈ (1...𝑀)) → ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
30 fveq2 6916 . . . . . . . 8 (𝑠 = 𝑡 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑡))
3130breq2d 5120 . . . . . . 7 (𝑠 = 𝑡 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑡)))
3230breq1d 5118 . . . . . . 7 (𝑠 = 𝑡 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑡) ≤ 1))
3331, 32anbi12d 644 . . . . . 6 (𝑠 = 𝑡 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1)))
3433cbvralvw 3244 . . . . 5 (∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ ∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1))
35 fveq2 6916 . . . . . . . 8 (𝑠 = 𝑆 → ((𝐺‘𝐼)‘𝑠) = ((𝐺‘𝐼)‘𝑆))
3635breq2d 5120 . . . . . . 7 (𝑠 = 𝑆 → (0 ≤ ((𝐺‘𝐼)‘𝑠) ↔ 0 ≤ ((𝐺‘𝐼)‘𝑆)))
3735breq1d 5118 . . . . . . 7 (𝑠 = 𝑆 → (((𝐺‘𝐼)‘𝑠) ≤ 1 ↔ ((𝐺‘𝐼)‘𝑆) ≤ 1))
3836, 37anbi12d 644 . . . . . 6 (𝑠 = 𝑆 → ((0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ↔ (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1)))
3938rspccva 3579 . . . . 5 ((∀𝑠 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑠) ∧ ((𝐺‘𝐼)‘𝑠) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
4034, 39sylanbr 594 . . . 4 ((∀𝑡 ∈ 𝑇 (0 ≤ ((𝐺‘𝐼)‘𝑡) ∧ ((𝐺‘𝐼)‘𝑡) ≤ 1) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
4129, 40sylan 592 . . 3 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
4241simpld 500 . 2 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → 0 ≤ ((𝐺‘𝐼)‘𝑆))
4341simprd 501 . 2 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → ((𝐺‘𝐼)‘𝑆) ≤ 1)
4416, 42, 433jca 1146 1 (((𝜑 ∧ 𝐼 ∈ (1...𝑀)) ∧ 𝑆 ∈ 𝑇) → (((𝐺‘𝐼)‘𝑆) ∈ ℝ ∧ 0 ≤ ((𝐺‘𝐼)‘𝑆) ∧ ((𝐺‘𝐼)‘𝑆) ≤ 1))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416   class class class wbr 5108  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  ℝcr 11238  0cc0 11239  1c1 11240   ≤ cle 11383  ...cfz 13679
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574
This theorem is used by:  stoweidlem30  47374  stoweidlem38  47382  stoweidlem44  47388
  Copyright terms: Public domain W3C validator