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

Theorem ioombl1lem3 24153
 Description: Lemma for ioombl1 24155. (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
ioombl1lem3 ((𝜑𝑛 ∈ ℕ) → ((((abs ∘ − ) ∘ 𝐺)‘𝑛) + (((abs ∘ − ) ∘ 𝐻)‘𝑛)) = (((abs ∘ − ) ∘ 𝐹)‘𝑛))
Distinct variable groups:   𝐵,𝑛   𝐶,𝑛   𝑛,𝐸   𝑛,𝐹   𝑛,𝐺   𝑛,𝐻   𝜑,𝑛   𝑆,𝑛
Allowed substitution hints:   𝐴(𝑛)   𝑃(𝑛)   𝑄(𝑛)   𝑇(𝑛)   𝑈(𝑛)

Proof of Theorem ioombl1lem3
StepHypRef Expression
1 ioombl1.q . . . . 5 𝑄 = (2nd ‘(𝐹𝑛))
2 ioombl1.f1 . . . . . . 7 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
3 ovolfcl 24059 . . . . . . 7 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
42, 3sylan 583 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → ((1st ‘(𝐹𝑛)) ∈ ℝ ∧ (2nd ‘(𝐹𝑛)) ∈ ℝ ∧ (1st ‘(𝐹𝑛)) ≤ (2nd ‘(𝐹𝑛))))
54simp2d 1140 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐹𝑛)) ∈ ℝ)
61, 5eqeltrid 2920 . . . 4 ((𝜑𝑛 ∈ ℕ) → 𝑄 ∈ ℝ)
76recnd 10654 . . 3 ((𝜑𝑛 ∈ ℕ) → 𝑄 ∈ ℂ)
8 ioombl1.a . . . . . . 7 (𝜑𝐴 ∈ ℝ)
98adantr 484 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝐴 ∈ ℝ)
10 ioombl1.p . . . . . . 7 𝑃 = (1st ‘(𝐹𝑛))
114simp1d 1139 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐹𝑛)) ∈ ℝ)
1210, 11eqeltrid 2920 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → 𝑃 ∈ ℝ)
139, 12ifcld 4493 . . . . 5 ((𝜑𝑛 ∈ ℕ) → if(𝑃𝐴, 𝐴, 𝑃) ∈ ℝ)
1413, 6ifcld 4493 . . . 4 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ)
1514recnd 10654 . . 3 ((𝜑𝑛 ∈ ℕ) → if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℂ)
1612recnd 10654 . . 3 ((𝜑𝑛 ∈ ℕ) → 𝑃 ∈ ℂ)
177, 15, 16npncand 11006 . 2 ((𝜑𝑛 ∈ ℕ) → ((𝑄 − if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)) + (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) − 𝑃)) = (𝑄𝑃))
18 ioombl1.b . . . . . . 7 𝐵 = (𝐴(,)+∞)
19 ioombl1.e . . . . . . 7 (𝜑𝐸 ⊆ ℝ)
20 ioombl1.v . . . . . . 7 (𝜑 → (vol*‘𝐸) ∈ ℝ)
21 ioombl1.c . . . . . . 7 (𝜑𝐶 ∈ ℝ+)
22 ioombl1.s . . . . . . 7 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
23 ioombl1.t . . . . . . 7 𝑇 = seq1( + , ((abs ∘ − ) ∘ 𝐺))
24 ioombl1.u . . . . . . 7 𝑈 = seq1( + , ((abs ∘ − ) ∘ 𝐻))
25 ioombl1.f2 . . . . . . 7 (𝜑𝐸 ran ((,) ∘ 𝐹))
26 ioombl1.f3 . . . . . . 7 (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶))
27 ioombl1.g . . . . . . 7 𝐺 = (𝑛 ∈ ℕ ↦ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
28 ioombl1.h . . . . . . 7 𝐻 = (𝑛 ∈ ℕ ↦ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
2918, 8, 19, 20, 21, 22, 23, 24, 2, 25, 26, 10, 1, 27, 28ioombl1lem1 24151 . . . . . 6 (𝜑 → (𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ))))
3029simpld 498 . . . . 5 (𝜑𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
31 eqid 2824 . . . . . 6 ((abs ∘ − ) ∘ 𝐺) = ((abs ∘ − ) ∘ 𝐺)
3231ovolfsval 24063 . . . . 5 ((𝐺:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺𝑛)) − (1st ‘(𝐺𝑛))))
3330, 32sylan 583 . . . 4 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = ((2nd ‘(𝐺𝑛)) − (1st ‘(𝐺𝑛))))
34 simpr 488 . . . . . . . 8 ((𝜑𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
35 opex 5337 . . . . . . . 8 ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ V
3627fvmpt2 6760 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩ ∈ V) → (𝐺𝑛) = ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
3734, 35, 36sylancl 589 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (𝐺𝑛) = ⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩)
3837fveq2d 6655 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐺𝑛)) = (2nd ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩))
39 op2ndg 7685 . . . . . . 7 ((if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ ∧ 𝑄 ∈ ℝ) → (2nd ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩) = 𝑄)
4014, 6, 39syl2anc 587 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (2nd ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩) = 𝑄)
4138, 40eqtrd 2859 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐺𝑛)) = 𝑄)
4237fveq2d 6655 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐺𝑛)) = (1st ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩))
43 op1stg 7684 . . . . . . 7 ((if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ ∧ 𝑄 ∈ ℝ) → (1st ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
4414, 6, 43syl2anc 587 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (1st ‘⟨if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄), 𝑄⟩) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
4542, 44eqtrd 2859 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐺𝑛)) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
4641, 45oveq12d 7156 . . . 4 ((𝜑𝑛 ∈ ℕ) → ((2nd ‘(𝐺𝑛)) − (1st ‘(𝐺𝑛))) = (𝑄 − if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
4733, 46eqtrd 2859 . . 3 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐺)‘𝑛) = (𝑄 − if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)))
4829simprd 499 . . . . 5 (𝜑𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
49 eqid 2824 . . . . . 6 ((abs ∘ − ) ∘ 𝐻) = ((abs ∘ − ) ∘ 𝐻)
5049ovolfsval 24063 . . . . 5 ((𝐻:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐻)‘𝑛) = ((2nd ‘(𝐻𝑛)) − (1st ‘(𝐻𝑛))))
5148, 50sylan 583 . . . 4 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐻)‘𝑛) = ((2nd ‘(𝐻𝑛)) − (1st ‘(𝐻𝑛))))
52 opex 5337 . . . . . . . 8 𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ V
5328fvmpt2 6760 . . . . . . . 8 ((𝑛 ∈ ℕ ∧ ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩ ∈ V) → (𝐻𝑛) = ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
5434, 52, 53sylancl 589 . . . . . . 7 ((𝜑𝑛 ∈ ℕ) → (𝐻𝑛) = ⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩)
5554fveq2d 6655 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐻𝑛)) = (2nd ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩))
56 op2ndg 7685 . . . . . . 7 ((𝑃 ∈ ℝ ∧ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ) → (2nd ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
5712, 14, 56syl2anc 587 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (2nd ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
5855, 57eqtrd 2859 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (2nd ‘(𝐻𝑛)) = if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄))
5954fveq2d 6655 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐻𝑛)) = (1st ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩))
60 op1stg 7684 . . . . . . 7 ((𝑃 ∈ ℝ ∧ if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) ∈ ℝ) → (1st ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩) = 𝑃)
6112, 14, 60syl2anc 587 . . . . . 6 ((𝜑𝑛 ∈ ℕ) → (1st ‘⟨𝑃, if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)⟩) = 𝑃)
6259, 61eqtrd 2859 . . . . 5 ((𝜑𝑛 ∈ ℕ) → (1st ‘(𝐻𝑛)) = 𝑃)
6358, 62oveq12d 7156 . . . 4 ((𝜑𝑛 ∈ ℕ) → ((2nd ‘(𝐻𝑛)) − (1st ‘(𝐻𝑛))) = (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) − 𝑃))
6451, 63eqtrd 2859 . . 3 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐻)‘𝑛) = (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) − 𝑃))
6547, 64oveq12d 7156 . 2 ((𝜑𝑛 ∈ ℕ) → ((((abs ∘ − ) ∘ 𝐺)‘𝑛) + (((abs ∘ − ) ∘ 𝐻)‘𝑛)) = ((𝑄 − if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄)) + (if(if(𝑃𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃𝐴, 𝐴, 𝑃), 𝑄) − 𝑃)))
66 eqid 2824 . . . . 5 ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹)
6766ovolfsval 24063 . . . 4 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹𝑛)) − (1st ‘(𝐹𝑛))))
682, 67sylan 583 . . 3 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = ((2nd ‘(𝐹𝑛)) − (1st ‘(𝐹𝑛))))
691, 10oveq12i 7150 . . 3 (𝑄𝑃) = ((2nd ‘(𝐹𝑛)) − (1st ‘(𝐹𝑛)))
7068, 69syl6eqr 2877 . 2 ((𝜑𝑛 ∈ ℕ) → (((abs ∘ − ) ∘ 𝐹)‘𝑛) = (𝑄𝑃))
7117, 65, 703eqtr4d 2869 1 ((𝜑𝑛 ∈ ℕ) → ((((abs ∘ − ) ∘ 𝐺)‘𝑛) + (((abs ∘ − ) ∘ 𝐻)‘𝑛)) = (((abs ∘ − ) ∘ 𝐹)‘𝑛))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2115  Vcvv 3479   ∩ cin 3917   ⊆ wss 3918  ifcif 4448  ⟨cop 4554  ∪ cuni 4819   class class class wbr 5047   ↦ cmpt 5127   × cxp 5534  ran crn 5537   ∘ ccom 5540  ⟶wf 6332  ‘cfv 6336  (class class class)co 7138  1st c1st 7670  2nd c2nd 7671  supcsup 8888  ℝcr 10521  1c1 10523   + caddc 10525  +∞cpnf 10657  ℝ*cxr 10659   < clt 10660   ≤ cle 10661   − cmin 10855  ℕcn 11623  ℝ+crp 12375  (,)cioo 12724  seqcseq 13362  abscabs 14582  vol*covol 24055 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 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2179  ax-ext 2796  ax-sep 5184  ax-nul 5191  ax-pow 5247  ax-pr 5311  ax-un 7444  ax-cnex 10578  ax-resscn 10579  ax-1cn 10580  ax-icn 10581  ax-addcl 10582  ax-addrcl 10583  ax-mulcl 10584  ax-mulrcl 10585  ax-mulcom 10586  ax-addass 10587  ax-mulass 10588  ax-distr 10589  ax-i2m1 10590  ax-1ne0 10591  ax-1rid 10592  ax-rnegex 10593  ax-rrecex 10594  ax-cnre 10595  ax-pre-lttri 10596  ax-pre-lttrn 10597  ax-pre-ltadd 10598  ax-pre-mulgt0 10599  ax-pre-sup 10600 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 2071  df-mo 2624  df-eu 2655  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2964  df-ne 3014  df-nel 3118  df-ral 3137  df-rex 3138  df-reu 3139  df-rmo 3140  df-rab 3141  df-v 3481  df-sbc 3758  df-csb 3866  df-dif 3921  df-un 3923  df-in 3925  df-ss 3935  df-pss 3937  df-nul 4275  df-if 4449  df-pw 4522  df-sn 4549  df-pr 4551  df-tp 4553  df-op 4555  df-uni 4820  df-iun 4902  df-br 5048  df-opab 5110  df-mpt 5128  df-tr 5154  df-id 5441  df-eprel 5446  df-po 5455  df-so 5456  df-fr 5495  df-we 5497  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-pred 6129  df-ord 6175  df-on 6176  df-lim 6177  df-suc 6178  df-iota 6295  df-fun 6338  df-fn 6339  df-f 6340  df-f1 6341  df-fo 6342  df-f1o 6343  df-fv 6344  df-riota 7096  df-ov 7141  df-oprab 7142  df-mpo 7143  df-om 7564  df-1st 7672  df-2nd 7673  df-wrecs 7930  df-recs 7991  df-rdg 8029  df-er 8272  df-en 8493  df-dom 8494  df-sdom 8495  df-sup 8890  df-pnf 10662  df-mnf 10663  df-xr 10664  df-ltxr 10665  df-le 10666  df-sub 10857  df-neg 10858  df-div 11283  df-nn 11624  df-2 11686  df-3 11687  df-n0 11884  df-z 11968  df-uz 12230  df-rp 12376  df-seq 13363  df-exp 13424  df-cj 14447  df-re 14448  df-im 14449  df-sqrt 14583  df-abs 14584 This theorem is referenced by:  ioombl1lem4  24154
 Copyright terms: Public domain W3C validator