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 14035 | . . 3 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
2 | 1 | eleq2i 2822 | . 2 ⊢ (𝑊 ∈ Word 𝑆 ↔ 𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
3 | ovex 7224 | . . . . 5 ⊢ (0..^𝑙) ∈ V | |
4 | fex 7020 | . . . . 5 ⊢ ((𝑊:(0..^𝑙)⟶𝑆 ∧ (0..^𝑙) ∈ V) → 𝑊 ∈ V) | |
5 | 3, 4 | mpan2 691 | . . . 4 ⊢ (𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V) |
6 | 5 | rexlimivw 3191 | . . 3 ⊢ (∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V) |
7 | feq1 6504 | . . . 4 ⊢ (𝑤 = 𝑊 → (𝑤:(0..^𝑙)⟶𝑆 ↔ 𝑊:(0..^𝑙)⟶𝑆)) | |
8 | 7 | rexbidv 3206 | . . 3 ⊢ (𝑤 = 𝑊 → (∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆)) |
9 | 6, 8 | elab3 3584 | . 2 ⊢ (𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆) |
10 | 2, 9 | bitri 278 | 1 ⊢ (𝑊 ∈ Word 𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 = wceq 1543 ∈ wcel 2112 {cab 2714 ∃wrex 3052 Vcvv 3398 ⟶wf 6354 (class class class)co 7191 0cc0 10694 ℕ0cn0 12055 ..^cfzo 13203 Word cword 14034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2160 ax-12 2177 ax-ext 2708 ax-rep 5164 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-nf 1792 df-sb 2073 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2728 df-clel 2809 df-nfc 2879 df-ne 2933 df-ral 3056 df-rex 3057 df-reu 3058 df-rab 3060 df-v 3400 df-sbc 3684 df-csb 3799 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-iun 4892 df-br 5040 df-opab 5102 df-mpt 5121 df-id 5440 df-xp 5542 df-rel 5543 df-cnv 5544 df-co 5545 df-dm 5546 df-rn 5547 df-res 5548 df-ima 5549 df-iota 6316 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7194 df-word 14035 |
This theorem is referenced by: iswrdi 14038 wrdf 14039 cshword 14321 motcgrg 26589 |
Copyright terms: Public domain | W3C validator |