Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ovolfcl | Structured version Visualization version GIF version |
Description: Closure for the interval endpoint function. (Contributed by Mario Carneiro, 16-Mar-2014.) |
Ref | Expression |
---|---|
ovolfcl | ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inss2 3796 | . . . . 5 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ) | |
2 | ffvelrn 6265 | . . . . 5 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ ( ≤ ∩ (ℝ × ℝ))) | |
3 | 1, 2 | sseldi 3566 | . . . 4 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ (ℝ × ℝ)) |
4 | 1st2nd2 7096 | . . . 4 ⊢ ((𝐹‘𝑁) ∈ (ℝ × ℝ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) |
6 | 5, 2 | eqeltrrd 2689 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
7 | ancom 465 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
8 | elin 3758 | . . . 4 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ))) | |
9 | df-br 4584 | . . . . . 6 ⊢ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ↔ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ) | |
10 | 9 | bicomi 213 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ↔ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) |
11 | opelxp 5070 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) | |
12 | 10, 11 | anbi12i 729 | . . . 4 ⊢ ((〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
13 | 8, 12 | bitri 263 | . . 3 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
14 | df-3an 1033 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
15 | 7, 13, 14 | 3bitr4i 291 | . 2 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
16 | 6, 15 | sylib 207 | 1 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1031 = wceq 1475 ∈ wcel 1977 ∩ cin 3539 〈cop 4131 class class class wbr 4583 × cxp 5036 ⟶wf 5800 ‘cfv 5804 1st c1st 7057 2nd c2nd 7058 ℝcr 9814 ≤ cle 9954 ℕcn 10897 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-1st 7059 df-2nd 7060 |
This theorem is referenced by: ovolfioo 23043 ovolficc 23044 ovolfsval 23046 ovolfsf 23047 ovollb2lem 23063 ovolshftlem1 23084 ovolscalem1 23088 ioombl1lem1 23133 ioombl1lem3 23135 ioombl1lem4 23136 ovolfs2 23145 uniiccdif 23152 uniioovol 23153 uniioombllem2a 23156 uniioombllem2 23157 uniioombllem3a 23158 uniioombllem3 23159 uniioombllem4 23160 uniioombllem6 23162 ovolval3 39537 |
Copyright terms: Public domain | W3C validator |