MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ioombl1lem1 Structured version   Visualization version   GIF version

Theorem ioombl1lem1 23546
Description: Lemma for ioombl1 23550. (Contributed by Mario Carneiro, 18-Aug-2014.)
Hypotheses
Ref Expression
ioombl1.b 𝐵 = (𝐴(,)+∞)
ioombl1.a (𝜑𝐴 ∈ ℝ)
ioombl1.e (𝜑𝐸 ⊆ ℝ)
ioombl1.v (𝜑 → (vol*‘𝐸) ∈ ℝ)
ioombl1.c (𝜑𝐶 ∈ ℝ+)
ioombl1.s 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
ioombl1.t 𝑇 = seq1( + , ((abs ∘ − ) ∘ 𝐺))
ioombl1.u 𝑈 = seq1( + , ((abs ∘ − ) ∘ 𝐻))
ioombl1.f1 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
ioombl1.f2 (𝜑𝐸 ran ((,) ∘ 𝐹))
ioombl1.f3 (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶))
ioombl1.p 𝑃 = (1st ‘(𝐹𝑛))
ioombl1.q 𝑄 = (2nd ‘(𝐹𝑛))
ioombl1.g 𝐺 = (𝑛 ∈ ℕ ↦ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
ioombl1.h 𝐻 = (𝑛 ∈ ℕ ↦ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
Assertion
Ref Expression
ioombl1lem1 (𝜑 → (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ))))
Distinct variable groups:   𝐵,𝑛   𝐶,𝑛   𝑛,𝐸   𝑛,𝐹   𝑛,𝐺   𝑛,𝐻   𝜑,𝑛   𝑆,𝑛
Allowed substitution hints:   𝐴(𝑛)   𝑃(𝑛)   𝑄(𝑛)   𝑇(𝑛)   𝑈(𝑛)

Proof of Theorem ioombl1lem1
StepHypRef Expression
1 ioombl1.a . . . . . . . 8 (𝜑𝐴 ∈ ℝ)
21adantr 472 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → 𝐴 ∈ ℝ)
3 ioombl1.p . . . . . . . 8 𝑃 = (1st ‘(𝐹𝑛))
4 ioombl1.f1 . . . . . . . . . 10 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
5 ovolfcl 23455 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
64, 5sylan 489 . . . . . . . . 9 ((𝜑𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
76simp1d 1137 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐹𝑛)) ∈ ℝ)
83, 7syl5eqel 2843 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → 𝑃 ∈ ℝ)
92, 8ifcld 4275 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → if(𝑃𝐴, 𝐴, 𝑃) ∈ ℝ)
10 ioombl1.q . . . . . . 7 𝑄 = (2nd ‘(𝐹𝑛))
116simp2d 1138 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐹𝑛)) ∈ ℝ)
1210, 11syl5eqel 2843 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑄 ∈ ℝ)
13 min2 12234 . . . . . 6 ((if(𝑃𝐴, 𝐴, 𝑃) ∈ ℝ ∧ 𝑄 ∈ ℝ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄)
149, 12, 13syl2anc 696 . . . . 5 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄)
15 df-br 4805 . . . . 5 (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄 ↔ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ≤ )
1614, 15sylib 208 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ≤ )
179, 12ifcld 4275 . . . . 5 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ)
18 opelxpi 5305 . . . . 5 ((if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ ∧ 𝑄 ∈ ℝ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ (ℝ × ℝ))
1917, 12, 18syl2anc 696 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ (ℝ × ℝ))
2016, 19elind 3941 . . 3 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
21 ioombl1.g . . 3 𝐺 = (𝑛 ∈ ℕ ↦ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
2220, 21fmptd 6549 . 2 (𝜑𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
23 max1 12229 . . . . . . 7 ((𝑃 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃))
248, 2, 23syl2anc 696 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃))
256simp3d 1139 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛)))
2625, 3, 103brtr4g 4838 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑃𝑄)
27 breq2 4808 . . . . . . 7 (if(𝑃𝐴, 𝐴, 𝑃) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) → (𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃) ↔ 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
28 breq2 4808 . . . . . . 7 (𝑄 = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) → (𝑃𝑄𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
2927, 28ifboth 4268 . . . . . 6 ((𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃) ∧ 𝑃𝑄) → 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
3024, 26, 29syl2anc 696 . . . . 5 ((𝜑𝑛 ∈ ℕ) → 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
31 df-br 4805 . . . . 5 (𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ↔ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ≤ )
3230, 31sylib 208 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ≤ )
33 opelxpi 5305 . . . . 5 ((𝑃 ∈ ℝ ∧ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ (ℝ × ℝ))
348, 17, 33syl2anc 696 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ (ℝ × ℝ))
3532, 34elind 3941 . . 3 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
36 ioombl1.h . . 3 𝐻 = (𝑛 ∈ ℕ ↦ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
3735, 36fmptd 6549 . 2 (𝜑𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
3822, 37jca 555 1 (𝜑 → (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1072   = wceq 1632  wcel 2139  cin 3714  wss 3715  ifcif 4230  cop 4327   cuni 4588   class class class wbr 4804  cmpt 4881   × cxp 5264  ran crn 5267  ccom 5270  wf 6045  cfv 6049  (class class class)co 6814  1st c1st 7332  2nd c2nd 7333  supcsup 8513  cr 10147  1c1 10149   + caddc 10151  +∞cpnf 10283  *cxr 10285   < clt 10286  cle 10287  cmin 10478  cn 11232  +crp 12045  (,)cioo 12388  seqcseq 13015  abscabs 14193  vol*covol 23451
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7115  ax-cnex 10204  ax-resscn 10205  ax-pre-lttri 10222  ax-pre-lttrn 10223
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-op 4328  df-uni 4589  df-br 4805  df-opab 4865  df-mpt 4882  df-id 5174  df-po 5187  df-so 5188  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-1st 7334  df-2nd 7335  df-er 7913  df-en 8124  df-dom 8125  df-sdom 8126  df-pnf 10288  df-mnf 10289  df-xr 10290  df-ltxr 10291  df-le 10292
This theorem is referenced by:  ioombl1lem3  23548  ioombl1lem4  23549
  Copyright terms: Public domain W3C validator