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

Theorem ioombl1lem1 24176
 Description: Lemma for ioombl1 24180. (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 484 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → 𝐴 ∈ ℝ)
3 ioombl1.p . . . . . . . 8 𝑃 = (1st ‘(𝐹𝑛))
4 ioombl1.f1 . . . . . . . . . 10 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
5 ovolfcl 24084 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
64, 5sylan 583 . . . . . . . . 9 ((𝜑𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
76simp1d 1139 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐹𝑛)) ∈ ℝ)
83, 7eqeltrid 2894 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → 𝑃 ∈ ℝ)
92, 8ifcld 4470 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → if(𝑃𝐴, 𝐴, 𝑃) ∈ ℝ)
10 ioombl1.q . . . . . . 7 𝑄 = (2nd ‘(𝐹𝑛))
116simp2d 1140 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐹𝑛)) ∈ ℝ)
1210, 11eqeltrid 2894 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑄 ∈ ℝ)
13 min2 12578 . . . . . 6 ((if(𝑃𝐴, 𝐴, 𝑃) ∈ ℝ ∧ 𝑄 ∈ ℝ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄)
149, 12, 13syl2anc 587 . . . . 5 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄)
15 df-br 5032 . . . . 5 (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ≤ 𝑄 ↔ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ≤ )
1614, 15sylib 221 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ≤ )
179, 12ifcld 4470 . . . . 5 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ)
1817, 12opelxpd 5558 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ (ℝ × ℝ))
1916, 18elind 4121 . . 3 ((𝜑𝑛 ∈ ℕ) → ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
20 ioombl1.g . . 3 𝐺 = (𝑛 ∈ ℕ ↦ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
2119, 20fmptd 6860 . 2 (𝜑𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
22 max1 12573 . . . . . . 7 ((𝑃 ∈ ℝ ∧ 𝐴 ∈ ℝ) → 𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃))
238, 2, 22syl2anc 587 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃))
246simp3d 1141 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛)))
2524, 3, 103brtr4g 5065 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑃𝑄)
26 breq2 5035 . . . . . . 7 (if(𝑃𝐴, 𝐴, 𝑃) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) → (𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃) ↔ 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
27 breq2 5035 . . . . . . 7 (𝑄 = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) → (𝑃𝑄𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
2826, 27ifboth 4463 . . . . . 6 ((𝑃 ≤ if(𝑃𝐴, 𝐴, 𝑃) ∧ 𝑃𝑄) → 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
2923, 25, 28syl2anc 587 . . . . 5 ((𝜑𝑛 ∈ ℕ) → 𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
30 df-br 5032 . . . . 5 (𝑃 ≤ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ↔ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ≤ )
3129, 30sylib 221 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ≤ )
328, 17opelxpd 5558 . . . 4 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ (ℝ × ℝ))
3331, 32elind 4121 . . 3 ((𝜑𝑛 ∈ ℕ) → ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
34 ioombl1.h . . 3 𝐻 = (𝑛 ∈ ℕ ↦ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
3533, 34fmptd 6860 . 2 (𝜑𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
3621, 35jca 515 1 (𝜑 → (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111   ∩ cin 3880   ⊆ wss 3881  ifcif 4425  ⟨cop 4531  ∪ cuni 4801   class class class wbr 5031   ↦ cmpt 5111   × cxp 5518  ran crn 5521   ∘ ccom 5524  ⟶wf 6323  ‘cfv 6327  (class class class)co 7140  1st c1st 7676  2nd c2nd 7677  supcsup 8895  ℝcr 10532  1c1 10534   + caddc 10536  +∞cpnf 10668  ℝ*cxr 10670   < clt 10671   ≤ cle 10672   − cmin 10866  ℕcn 11632  ℝ+crp 12384  (,)cioo 12733  seqcseq 13371  abscabs 14592  vol*covol 24080 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 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5168  ax-nul 5175  ax-pow 5232  ax-pr 5296  ax-un 7448  ax-cnex 10589  ax-resscn 10590  ax-pre-lttri 10607  ax-pre-lttrn 10608 This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-nel 3092  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4802  df-br 5032  df-opab 5094  df-mpt 5112  df-id 5426  df-po 5439  df-so 5440  df-xp 5526  df-rel 5527  df-cnv 5528  df-co 5529  df-dm 5530  df-rn 5531  df-res 5532  df-ima 5533  df-iota 6286  df-fun 6329  df-fn 6330  df-f 6331  df-f1 6332  df-fo 6333  df-f1o 6334  df-fv 6335  df-1st 7678  df-2nd 7679  df-er 8279  df-en 8500  df-dom 8501  df-sdom 8502  df-pnf 10673  df-mnf 10674  df-xr 10675  df-ltxr 10676  df-le 10677 This theorem is referenced by:  ioombl1lem3  24178  ioombl1lem4  24179
 Copyright terms: Public domain W3C validator