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 | ffvelrn 6844 | . . . . 5 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ ( ≤ ∩ (ℝ × ℝ))) | |
2 | 1 | elin2d 4176 | . . . 4 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) ∈ (ℝ × ℝ)) |
3 | 1st2nd2 7722 | . . . 4 ⊢ ((𝐹‘𝑁) ∈ (ℝ × ℝ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) | |
4 | 2, 3 | syl 17 | . . 3 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → (𝐹‘𝑁) = 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉) |
5 | 4, 1 | eqeltrrd 2914 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ))) |
6 | ancom 463 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
7 | elin 4169 | . . . 4 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ))) | |
8 | df-br 5060 | . . . . . 6 ⊢ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ↔ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ) | |
9 | 8 | bicomi 226 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ↔ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) |
10 | opelxp 5586 | . . . . 5 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ)) | |
11 | 9, 10 | anbi12i 628 | . . . 4 ⊢ ((〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ≤ ∧ 〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
12 | 7, 11 | bitri 277 | . . 3 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)) ∧ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ))) |
13 | df-3an 1085 | . . 3 ⊢ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁))) ↔ (((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ) ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) | |
14 | 6, 12, 13 | 3bitr4i 305 | . 2 ⊢ (〈(1st ‘(𝐹‘𝑁)), (2nd ‘(𝐹‘𝑁))〉 ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
15 | 5, 14 | sylib 220 | 1 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑁 ∈ ℕ) → ((1st ‘(𝐹‘𝑁)) ∈ ℝ ∧ (2nd ‘(𝐹‘𝑁)) ∈ ℝ ∧ (1st ‘(𝐹‘𝑁)) ≤ (2nd ‘(𝐹‘𝑁)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∩ cin 3935 〈cop 4567 class class class wbr 5059 × cxp 5548 ⟶wf 6346 ‘cfv 6350 1st c1st 7681 2nd c2nd 7682 ℝcr 10530 ≤ cle 10670 ℕcn 11632 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-fv 6358 df-1st 7683 df-2nd 7684 |
This theorem is referenced by: ovolfioo 24062 ovolficc 24063 ovolfsval 24065 ovolfsf 24066 ovollb2lem 24083 ovolshftlem1 24104 ovolscalem1 24108 ioombl1lem1 24153 ioombl1lem3 24155 ioombl1lem4 24156 ovolfs2 24166 uniiccdif 24173 uniioovol 24174 uniioombllem2a 24177 uniioombllem2 24178 uniioombllem3a 24179 uniioombllem3 24180 uniioombllem4 24181 uniioombllem6 24183 ovolval3 42922 |
Copyright terms: Public domain | W3C validator |