![]() |
Mathbox for Ender Ting |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > upwordsseti | Structured version Visualization version GIF version |
Description: Strictly increasing sequences with a set given for range form a set. (Contributed by Ender Ting, 21-Nov-2024.) |
Ref | Expression |
---|---|
upwordsseti.1 | ⊢ 𝑆 ∈ V |
Ref | Expression |
---|---|
upwordsseti | ⊢ UpWord 𝑆 ∈ V |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upwordsseti.1 | . . 3 ⊢ 𝑆 ∈ V | |
2 | 1 | wrdexi 14534 | . 2 ⊢ Word 𝑆 ∈ V |
3 | upwordisword 46500 | . . 3 ⊢ (𝑡 ∈ UpWord 𝑆 → 𝑡 ∈ Word 𝑆) | |
4 | 3 | ssriv 3983 | . 2 ⊢ UpWord 𝑆 ⊆ Word 𝑆 |
5 | 2, 4 | ssexi 5327 | 1 ⊢ UpWord 𝑆 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2099 Vcvv 3462 Word cword 14522 UpWord cupword 46497 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-cnex 11214 ax-1cn 11216 ax-addcl 11218 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7877 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-rdg 8440 df-map 8857 df-nn 12265 df-n0 12525 df-word 14523 df-upword 46498 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |