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

Theorem uniioombllem2a 25958
Description: Lemma for uniioombl 25965. (Contributed by Mario Carneiro, 7-May-2015.)
Hypotheses
Ref Expression
uniioombl.1 (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
uniioombl.2 (𝜑 → Disj 𝑥 ∈ ℕ ((,)‘(𝐹‘𝑥)))
uniioombl.3 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
uniioombl.a 𝐴 = ∪ ran ((,) ∘ 𝐹)
uniioombl.e (𝜑 → (vol*‘𝐸) ∈ ℝ)
uniioombl.c (𝜑 → 𝐶 ∈ ℝ+)
uniioombl.g (𝜑 → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
uniioombl.s (𝜑 → 𝐸 ⊆ ∪ ran ((,) ∘ 𝐺))
uniioombl.t 𝑇 = seq1( + , ((abs ∘ − ) ∘ 𝐺))
uniioombl.v (𝜑 → sup(ran 𝑇, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶))
Assertion
Ref Expression
uniioombllem2a (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (((,)‘(𝐹‘𝑧)) ∩ ((,)‘(𝐺‘𝐽))) ∈ ran (,))
Distinct variable groups:   𝑥,𝑧,𝐹   𝑥,𝐺,𝑧   𝑥,𝐴,𝑧   𝑥,𝐶,𝑧   𝑥,𝐽,𝑧   𝜑,𝑥,𝑧   𝑥,𝑇,𝑧
Allowed substitution hints:   𝑆(𝑥, 𝑧)   𝐸(𝑥, 𝑧)

Proof of Theorem uniioombllem2a
StepHypRef Expression
1 uniioombl.1 . . . . . . . . . 10 (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
21adantr 486 . . . . . . . . 9 ((𝜑 ∧ 𝐽 ∈ ℕ) → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
32ffvelcdmda 7116 . . . . . . . 8 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (𝐹‘𝑧) ∈ ( ≤ ∩ (ℝ × ℝ)))
43elin2d 4105 . . . . . . 7 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (𝐹‘𝑧) ∈ (ℝ × ℝ))
5 1st2nd2 8074 . . . . . . 7 ((𝐹‘𝑧) ∈ (ℝ × ℝ) → (𝐹‘𝑧) = ⟨(1st ‘(𝐹‘𝑧)), (2nd ‘(𝐹‘𝑧))⟩)
64, 5syl 18 . . . . . 6 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (𝐹‘𝑧) = ⟨(1st ‘(𝐹‘𝑧)), (2nd ‘(𝐹‘𝑧))⟩)
76fveq2d 6920 . . . . 5 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → ((,)‘(𝐹‘𝑧)) = ((,)‘⟨(1st ‘(𝐹‘𝑧)), (2nd ‘(𝐹‘𝑧))⟩))
8 df-ov 7454 . . . . 5 ((1st ‘(𝐹‘𝑧))(,)(2nd ‘(𝐹‘𝑧))) = ((,)‘⟨(1st ‘(𝐹‘𝑧)), (2nd ‘(𝐹‘𝑧))⟩)
97, 8eqtr4di 2816 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → ((,)‘(𝐹‘𝑧)) = ((1st ‘(𝐹‘𝑧))(,)(2nd ‘(𝐹‘𝑧))))
10 uniioombl.g . . . . . . . . . 10 (𝜑 → 𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
1110ffvelcdmda 7116 . . . . . . . . 9 ((𝜑 ∧ 𝐽 ∈ ℕ) → (𝐺‘𝐽) ∈ ( ≤ ∩ (ℝ × ℝ)))
1211elin2d 4105 . . . . . . . 8 ((𝜑 ∧ 𝐽 ∈ ℕ) → (𝐺‘𝐽) ∈ (ℝ × ℝ))
13 1st2nd2 8074 . . . . . . . 8 ((𝐺‘𝐽) ∈ (ℝ × ℝ) → (𝐺‘𝐽) = ⟨(1st ‘(𝐺‘𝐽)), (2nd ‘(𝐺‘𝐽))⟩)
1412, 13syl 18 . . . . . . 7 ((𝜑 ∧ 𝐽 ∈ ℕ) → (𝐺‘𝐽) = ⟨(1st ‘(𝐺‘𝐽)), (2nd ‘(𝐺‘𝐽))⟩)
1514fveq2d 6920 . . . . . 6 ((𝜑 ∧ 𝐽 ∈ ℕ) → ((,)‘(𝐺‘𝐽)) = ((,)‘⟨(1st ‘(𝐺‘𝐽)), (2nd ‘(𝐺‘𝐽))⟩))
16 df-ov 7454 . . . . . 6 ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽))) = ((,)‘⟨(1st ‘(𝐺‘𝐽)), (2nd ‘(𝐺‘𝐽))⟩)
1715, 16eqtr4di 2816 . . . . 5 ((𝜑 ∧ 𝐽 ∈ ℕ) → ((,)‘(𝐺‘𝐽)) = ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽))))
1817adantr 486 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → ((,)‘(𝐺‘𝐽)) = ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽))))
199, 18ineq12d 4121 . . 3 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (((,)‘(𝐹‘𝑧)) ∩ ((,)‘(𝐺‘𝐽))) = (((1st ‘(𝐹‘𝑧))(,)(2nd ‘(𝐹‘𝑧))) ∩ ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽)))))
20 ovolfcl 25842 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑧 ∈ ℕ) → ((1st ‘(𝐹‘𝑧)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑧)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐹‘𝑧))))
212, 20sylan 592 . . . . . 6 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → ((1st ‘(𝐹‘𝑧)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑧)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐹‘𝑧))))
2221simp1d 1160 . . . . 5 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (1st ‘(𝐹‘𝑧)) ∈ ℝ)
2322rexrd 11398 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (1st ‘(𝐹‘𝑧)) ∈ ℝ*)
2421simp2d 1161 . . . . 5 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (2nd ‘(𝐹‘𝑧)) ∈ ℝ)
2524rexrd 11398 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (2nd ‘(𝐹‘𝑧)) ∈ ℝ*)
26 ovolfcl 25842 . . . . . . . 8 ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐽 ∈ ℕ) → ((1st ‘(𝐺‘𝐽)) ∈ ℝ ∧ (2nd ‘(𝐺‘𝐽)) ∈ ℝ ∧ (1st ‘(𝐺‘𝐽)) ≤ (2nd ‘(𝐺‘𝐽))))
2710, 26sylan 592 . . . . . . 7 ((𝜑 ∧ 𝐽 ∈ ℕ) → ((1st ‘(𝐺‘𝐽)) ∈ ℝ ∧ (2nd ‘(𝐺‘𝐽)) ∈ ℝ ∧ (1st ‘(𝐺‘𝐽)) ≤ (2nd ‘(𝐺‘𝐽))))
2827simp1d 1160 . . . . . 6 ((𝜑 ∧ 𝐽 ∈ ℕ) → (1st ‘(𝐺‘𝐽)) ∈ ℝ)
2928rexrd 11398 . . . . 5 ((𝜑 ∧ 𝐽 ∈ ℕ) → (1st ‘(𝐺‘𝐽)) ∈ ℝ*)
3029adantr 486 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (1st ‘(𝐺‘𝐽)) ∈ ℝ*)
3127simp2d 1161 . . . . . 6 ((𝜑 ∧ 𝐽 ∈ ℕ) → (2nd ‘(𝐺‘𝐽)) ∈ ℝ)
3231rexrd 11398 . . . . 5 ((𝜑 ∧ 𝐽 ∈ ℕ) → (2nd ‘(𝐺‘𝐽)) ∈ ℝ*)
3332adantr 486 . . . 4 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (2nd ‘(𝐺‘𝐽)) ∈ ℝ*)
34 iooin 13550 . . . 4 ((((1st ‘(𝐹‘𝑧)) ∈ ℝ* ∧ (2nd ‘(𝐹‘𝑧)) ∈ ℝ*) ∧ ((1st ‘(𝐺‘𝐽)) ∈ ℝ* ∧ (2nd ‘(𝐺‘𝐽)) ∈ ℝ*)) → (((1st ‘(𝐹‘𝑧))(,)(2nd ‘(𝐹‘𝑧))) ∩ ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽)))) = (if((1st ‘(𝐹‘𝑧)) ≤ (1st ‘(𝐺‘𝐽)), (1st ‘(𝐺‘𝐽)), (1st ‘(𝐹‘𝑧)))(,)if((2nd ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐺‘𝐽)), (2nd ‘(𝐹‘𝑧)), (2nd ‘(𝐺‘𝐽)))))
3523, 25, 30, 33, 34syl22anc 852 . . 3 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (((1st ‘(𝐹‘𝑧))(,)(2nd ‘(𝐹‘𝑧))) ∩ ((1st ‘(𝐺‘𝐽))(,)(2nd ‘(𝐺‘𝐽)))) = (if((1st ‘(𝐹‘𝑧)) ≤ (1st ‘(𝐺‘𝐽)), (1st ‘(𝐺‘𝐽)), (1st ‘(𝐹‘𝑧)))(,)if((2nd ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐺‘𝐽)), (2nd ‘(𝐹‘𝑧)), (2nd ‘(𝐺‘𝐽)))))
3619, 35eqtrd 2798 . 2 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (((,)‘(𝐹‘𝑧)) ∩ ((,)‘(𝐺‘𝐽))) = (if((1st ‘(𝐹‘𝑧)) ≤ (1st ‘(𝐺‘𝐽)), (1st ‘(𝐺‘𝐽)), (1st ‘(𝐹‘𝑧)))(,)if((2nd ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐺‘𝐽)), (2nd ‘(𝐹‘𝑧)), (2nd ‘(𝐺‘𝐽)))))
37 ioorebas 13622 . 2 (if((1st ‘(𝐹‘𝑧)) ≤ (1st ‘(𝐺‘𝐽)), (1st ‘(𝐺‘𝐽)), (1st ‘(𝐹‘𝑧)))(,)if((2nd ‘(𝐹‘𝑧)) ≤ (2nd ‘(𝐺‘𝐽)), (2nd ‘(𝐹‘𝑧)), (2nd ‘(𝐺‘𝐽)))) ∈ ran (,)
3836, 37eqeltrdi 2872 1 (((𝜑 ∧ 𝐽 ∈ ℕ) ∧ 𝑧 ∈ ℕ) → (((,)‘(𝐹‘𝑧)) ∩ ((,)‘(𝐺‘𝐽))) ∈ ran (,))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900   ∩ cin 4092  ifcif 4485  ⟨cop 4840  ∪ cuni 4872  Disj wdisj 5075   class class class wbr 5108   × cxp 5656  ran crn 5659   ∘ ccom 5662  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  supcsup 9469  ℝcr 11238  1c1 11240   + caddc 11242  ℝ*cxr 11381   < clt 11382   ≤ cle 11383   − cmin 11580  ℕcn 12375  ℝ+crp 13160  (,)cioo 13516  seqcseq 14184  abscabs 15444  vol*covol 25838
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-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316  ax-pre-sup 11317
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-sup 9471  df-inf 9472  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-div 12014  df-nn 12376  df-n0 12647  df-z 12734  df-uz 13006  df-q 13116  df-ioo 13520
This theorem is used by:  uniioombllem2  25959
  Copyright terms: Public domain W3C validator