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 13874 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 13867 | . 2 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 = ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙))) | |
2 | mapsspw 8445 | . . . . . 6 ⊢ (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 ((0..^𝑙) × 𝑆) | |
3 | elfzoelz 13041 | . . . . . . . . 9 ⊢ (𝑠 ∈ (0..^𝑙) → 𝑠 ∈ ℤ) | |
4 | 3 | ssriv 3974 | . . . . . . . 8 ⊢ (0..^𝑙) ⊆ ℤ |
5 | xpss1 5577 | . . . . . . . 8 ⊢ ((0..^𝑙) ⊆ ℤ → ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆)) | |
6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) |
7 | sspwb 5345 | . . . . . . 7 ⊢ (((0..^𝑙) × 𝑆) ⊆ (ℤ × 𝑆) ↔ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆)) | |
8 | 6, 7 | mpbi 232 | . . . . . 6 ⊢ 𝒫 ((0..^𝑙) × 𝑆) ⊆ 𝒫 (ℤ × 𝑆) |
9 | 2, 8 | sstri 3979 | . . . . 5 ⊢ (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
10 | 9 | rgenw 3153 | . . . 4 ⊢ ∀𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
11 | iunss 4972 | . . . 4 ⊢ (∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ↔ ∀𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆)) | |
12 | 10, 11 | mpbir 233 | . . 3 ⊢ ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) |
13 | zex 11993 | . . . . 5 ⊢ ℤ ∈ V | |
14 | xpexg 7476 | . . . . 5 ⊢ ((ℤ ∈ V ∧ 𝑆 ∈ 𝑉) → (ℤ × 𝑆) ∈ V) | |
15 | 13, 14 | mpan 688 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → (ℤ × 𝑆) ∈ V) |
16 | 15 | pwexd 5283 | . . 3 ⊢ (𝑆 ∈ 𝑉 → 𝒫 (ℤ × 𝑆) ∈ V) |
17 | ssexg 5230 | . . 3 ⊢ ((∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ⊆ 𝒫 (ℤ × 𝑆) ∧ 𝒫 (ℤ × 𝑆) ∈ V) → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ∈ V) | |
18 | 12, 16, 17 | sylancr 589 | . 2 ⊢ (𝑆 ∈ 𝑉 → ∪ 𝑙 ∈ ℕ0 (𝑆 ↑m (0..^𝑙)) ∈ V) |
19 | 1, 18 | eqeltrd 2916 | 1 ⊢ (𝑆 ∈ 𝑉 → Word 𝑆 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2113 ∀wral 3141 Vcvv 3497 ⊆ wss 3939 𝒫 cpw 4542 ∪ ciun 4922 × cxp 5556 (class class class)co 7159 ↑m cmap 8409 0cc0 10540 ℕ0cn0 11900 ℤcz 11984 ..^cfzo 13036 Word cword 13864 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-id 5463 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-1st 7692 df-2nd 7693 df-map 8411 df-pm 8412 df-neg 10876 df-z 11985 df-uz 12247 df-fz 12896 df-fzo 13037 df-word 13865 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |