![]() |
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 14568 | . 2 ⊢ Word 𝑆 ∈ V |
3 | upwordisword 46790 | . . 3 ⊢ (𝑡 ∈ UpWord 𝑆 → 𝑡 ∈ Word 𝑆) | |
4 | 3 | ssriv 4012 | . 2 ⊢ UpWord 𝑆 ⊆ Word 𝑆 |
5 | 2, 4 | ssexi 5340 | 1 ⊢ UpWord 𝑆 ∈ V |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2108 Vcvv 3488 Word cword 14556 UpWord cupword 46787 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7764 ax-cnex 11234 ax-1cn 11236 ax-addcl 11238 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5650 df-we 5652 df-xp 5701 df-rel 5702 df-cnv 5703 df-co 5704 df-dm 5705 df-rn 5706 df-res 5707 df-ima 5708 df-pred 6327 df-ord 6393 df-on 6394 df-lim 6395 df-suc 6396 df-iota 6520 df-fun 6570 df-fn 6571 df-f 6572 df-f1 6573 df-fo 6574 df-f1o 6575 df-fv 6576 df-ov 7446 df-oprab 7447 df-mpo 7448 df-om 7898 df-2nd 8025 df-frecs 8316 df-wrecs 8347 df-recs 8421 df-rdg 8460 df-map 8880 df-nn 12288 df-n0 12548 df-word 14557 df-upword 46788 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |