Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elovolmr | Structured version Visualization version GIF version |
Description: Sufficient condition for elementhood in the set 𝑀. (Contributed by Mario Carneiro, 16-Mar-2014.) |
Ref | Expression |
---|---|
elovolm.1 | ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} |
elovolmr.2 | ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) |
Ref | Expression |
---|---|
elovolmr | ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → sup(ran 𝑆, ℝ*, < ) ∈ 𝑀) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elovolmlem 24075 | . . 3 ⊢ (𝐹 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ↔ 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) | |
2 | elovolmr.2 | . . . . . . . . 9 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
3 | id 22 | . . . . . . . . . . . 12 ⊢ (𝑓 = 𝐹 → 𝑓 = 𝐹) | |
4 | 3 | eqcomd 2827 | . . . . . . . . . . 11 ⊢ (𝑓 = 𝐹 → 𝐹 = 𝑓) |
5 | 4 | coeq2d 5733 | . . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝑓)) |
6 | 5 | seqeq3d 13378 | . . . . . . . . 9 ⊢ (𝑓 = 𝐹 → seq1( + , ((abs ∘ − ) ∘ 𝐹)) = seq1( + , ((abs ∘ − ) ∘ 𝑓))) |
7 | 2, 6 | syl5eq 2868 | . . . . . . . 8 ⊢ (𝑓 = 𝐹 → 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝑓))) |
8 | 7 | rneqd 5808 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → ran 𝑆 = ran seq1( + , ((abs ∘ − ) ∘ 𝑓))) |
9 | 8 | supeq1d 8910 | . . . . . 6 ⊢ (𝑓 = 𝐹 → sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) |
10 | 9 | biantrud 534 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ↔ (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )))) |
11 | coeq2 5729 | . . . . . . . 8 ⊢ (𝑓 = 𝐹 → ((,) ∘ 𝑓) = ((,) ∘ 𝐹)) | |
12 | 11 | rneqd 5808 | . . . . . . 7 ⊢ (𝑓 = 𝐹 → ran ((,) ∘ 𝑓) = ran ((,) ∘ 𝐹)) |
13 | 12 | unieqd 4852 | . . . . . 6 ⊢ (𝑓 = 𝐹 → ∪ ran ((,) ∘ 𝑓) = ∪ ran ((,) ∘ 𝐹)) |
14 | 13 | sseq2d 3999 | . . . . 5 ⊢ (𝑓 = 𝐹 → (𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ↔ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))) |
15 | 10, 14 | bitr3d 283 | . . . 4 ⊢ (𝑓 = 𝐹 → ((𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹))) |
16 | 15 | rspcev 3623 | . . 3 ⊢ ((𝐹 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) |
17 | 1, 16 | sylanbr 584 | . 2 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) |
18 | elovolm.1 | . . 3 ⊢ 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} | |
19 | 18 | elovolm 24076 | . 2 ⊢ (sup(ran 𝑆, ℝ*, < ) ∈ 𝑀 ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ⊆ ∪ ran ((,) ∘ 𝑓) ∧ sup(ran 𝑆, ℝ*, < ) = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))) |
20 | 17, 19 | sylibr 236 | 1 ⊢ ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝐴 ⊆ ∪ ran ((,) ∘ 𝐹)) → sup(ran 𝑆, ℝ*, < ) ∈ 𝑀) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∃wrex 3139 {crab 3142 ∩ cin 3935 ⊆ wss 3936 ∪ cuni 4838 × cxp 5553 ran crn 5556 ∘ ccom 5559 ⟶wf 6351 (class class class)co 7156 ↑m cmap 8406 supcsup 8904 ℝcr 10536 1c1 10538 + caddc 10540 ℝ*cxr 10674 < clt 10675 ≤ cle 10676 − cmin 10870 ℕcn 11638 (,)cioo 12739 seqcseq 13370 abscabs 14593 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-map 8408 df-en 8510 df-dom 8511 df-sdom 8512 df-sup 8906 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-ico 12745 df-fz 12894 df-seq 13371 df-exp 13431 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 |
This theorem is referenced by: ovollb 24080 ovolshftlem1 24110 |
Copyright terms: Public domain | W3C validator |