| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iswrd | Structured version Visualization version GIF version | ||
| Description: Property of being a word over a set with an existential quantifier over the length. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) (Proof shortened by AV, 13-May-2020.) |
| Ref | Expression |
|---|---|
| iswrd | ⊢ (𝑊 ∈ Word 𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-word 14467 | . . 3 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 2 | 1 | eleq2i 2829 | . 2 ⊢ (𝑊 ∈ Word 𝑆 ↔ 𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 3 | ovex 7393 | . . . . 5 ⊢ (0..^𝑙) ∈ V | |
| 4 | fex 7174 | . . . . 5 ⊢ ((𝑊:(0..^𝑙)⟶𝑆 ∧ (0..^𝑙) ∈ V) → 𝑊 ∈ V) | |
| 5 | 3, 4 | mpan2 692 | . . . 4 ⊢ (𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V) |
| 6 | 5 | rexlimivw 3135 | . . 3 ⊢ (∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V) |
| 7 | feq1 6640 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑤:(0..^𝑙)⟶𝑆 ↔ 𝑊:(0..^𝑙)⟶𝑆)) | |
| 8 | 7 | rexbidv 3162 | . . 3 ⊢ (𝑤 = 𝑊 → (∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆)) |
| 9 | 6, 8 | elab3 3630 | . 2 ⊢ (𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆) |
| 10 | 2, 9 | bitri 275 | 1 ⊢ (𝑊 ∈ Word 𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1542 ∈ wcel 2114 {cab 2715 ∃wrex 3062 Vcvv 3430 ⟶wf 6488 (class class class)co 7360 0cc0 11029 ℕ0cn0 12428 ..^cfzo 13599 Word cword 14466 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7363 df-word 14467 |
| This theorem is referenced by: iswrdi 14470 wrdf 14471 cshword 14744 motcgrg 28626 chnsubseqword 47324 |
| Copyright terms: Public domain | W3C validator |