Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > wrdexgOLD | Structured version Visualization version GIF version |
Description: Obsolete proof of wrdexg 13872 as of 29-Apr-2023. (Contributed by Mario Carneiro, 26-Feb-2016.) (New usage is discouraged.) (Proof modification is discouraged.) |
Ref | Expression |
---|---|
wrdexgOLD | ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wrdval 13865 | . 2 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙))) | |
2 | mapsspw 8442 | . . . . . 6 ⊢ (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 ((0..^𝑙) × 𝑆) | |
3 | elfzoelz 13039 | . . . . . . . . 9 ⊢ (𝑠 ∈ (0..^𝑙) → 𝑠 ∈ ℤ) | |
4 | 3 | ssriv 3971 | . . . . . . . 8 ⊢ (0..^𝑙) ⊆ ℤ |
5 | xpss1 5574 | . . . . . . . 8 ⊢ ((0..^𝑙) ⊆ ℤ → ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆)) | |
6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) |
7 | sspwb 5342 | . . . . . . 7 ⊢ (((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) ↔ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆)) | |
8 | 6, 7 | mpbi 232 | . . . . . 6 ⊢ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆) |
9 | 2, 8 | sstri 3976 | . . . . 5 ⊢ (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
10 | 9 | rgenw 3150 | . . . 4 ⊢ ∀𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
11 | iunss 4969 | . . . 4 ⊢ (∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ↔ ∀𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆)) | |
12 | 10, 11 | mpbir 233 | . . 3 ⊢ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
13 | zex 11991 | . . . . 5 ⊢ ℤ ∈ V | |
14 | xpexg 7473 | . . . . 5 ⊢ ((ℤ ∈ V ∧ 𝑆 ∈ 𝑉) → (ℤ × 𝑆) ∈ V) | |
15 | 13, 14 | mpan 688 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (ℤ × 𝑆) ∈ V) |
16 | 15 | pwexd 5280 | . . 3 ⊢ (𝑆 ∈ 𝑉 → 𝒫 (ℤ × 𝑆) ∈ V) |
17 | ssexg 5227 | . . 3 ⊢ ((∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ∧ 𝒫 (ℤ × 𝑆) ∈ V) → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ∈ V) | |
18 | 12, 16, 17 | sylancr 589 | . 2 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ∈ V) |
19 | 1, 18 | eqeltrd 2913 | 1 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2114 ∀wral 3138 Vcvv 3494 ⊆ wss 3936 𝒫 cpw 4539 ∪ ciun 4919 × cxp 5553 (class class class)co 7156 ↑m cmap 8406 0cc0 10537 ℕ0cn0 11898 ℤcz 11982 ..^cfzo 13034 Word cword 13862 |
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 |
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-ral 3143 df-rex 3144 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-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 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-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-1st 7689 df-2nd 7690 df-map 8408 df-pm 8409 df-neg 10873 df-z 11983 df-uz 12245 df-fz 12894 df-fzo 13035 df-word 13863 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |