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 3834 | . . . . 5 ⊢ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ) | |
2 | ffvelrn 6357 | . . . . 5 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ ( ≤ ∩ (ℝ × ℝ))) | |
3 | 1, 2 | sseldi 3601 | . . . 4 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ (ℝ × ℝ)) |
4 | 1st2nd2 7205 | . . . 4 ⊢ ((𝐹‘𝑁) ∈ (ℝ × ℝ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) | |
5 | 3, 4 | syl 17 | . . 3 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) |
6 | 5, 2 | eqeltrrd 2702 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
7 | ancom 466 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
8 | elin 3796 | . . . 4 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ))) | |
9 | df-br 4654 | . . . . . 6 ⊢ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ↔ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ) | |
10 | 9 | bicomi 214 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ↔ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) |
11 | opelxp 5146 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) | |
12 | 10, 11 | anbi12i 733 | . . . 4 ⊢ ((〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
13 | 8, 12 | bitri 264 | . . 3 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
14 | df-3an 1039 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
15 | 7, 13, 14 | 3bitr4i 292 | . 2 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
16 | 6, 15 | sylib 208 | 1 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ∩ cin 3573 〈cop 4183 class class class wbr 4653 × cxp 5112 ⟶wf 5884 ‘cfv 5888 1st c1st 7166 2nd c2nd 7167 ℝcr 9935 ≤ cle 10075 ℕcn 11020 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-fv 5896 df-1st 7168 df-2nd 7169 |
This theorem is referenced by: ovolfioo 23236 ovolficc 23237 ovolfsval 23239 ovolfsf 23240 ovollb2lem 23256 ovolshftlem1 23277 ovolscalem1 23281 ioombl1lem1 23326 ioombl1lem3 23328 ioombl1lem4 23329 ovolfs2 23339 uniiccdif 23346 uniioovol 23347 uniioombllem2a 23350 uniioombllem2 23351 uniioombllem3a 23352 uniioombllem3 23353 uniioombllem4 23354 uniioombllem6 23356 ovolval3 40861 |
Copyright terms: Public domain | W3C validator |