| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > csbwrdg | Structured version Visualization version GIF version | ||
| Description: Class substitution for the symbols of a word. (Contributed by Alexander van der Vekens, 15-Jul-2018.) |
| Ref | Expression |
|---|---|
| csbwrdg | ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌Word 𝑥 = Word 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-word 14479 | . . 3 ⊢ Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 2 | 1 | csbeq2i 3870 | . 2 ⊢ ⦋𝑆 / 𝑥⦌Word 𝑥 = ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} |
| 3 | sbcrex 3838 | . . . . 5 ⊢ ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥) | |
| 4 | sbcfg 6686 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥)) | |
| 5 | csbconstg 3881 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑤 = 𝑤) | |
| 6 | csbconstg 3881 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌(0..^𝑙) = (0..^𝑙)) | |
| 7 | csbvarg 4397 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑥 = 𝑆) | |
| 8 | 5, 6, 7 | feq123d 6677 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → (⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 9 | 4, 8 | bitrd 279 | . . . . . 6 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 10 | 9 | rexbidv 3157 | . . . . 5 ⊢ (𝑆 ∈ 𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 11 | 3, 10 | bitrid 283 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 12 | 11 | abbidv 2795 | . . 3 ⊢ (𝑆 ∈ 𝑉 → {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 13 | csbab 4403 | . . 3 ⊢ ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 14 | df-word 14479 | . . 3 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 15 | 12, 13, 14 | 3eqtr4g 2789 | . 2 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆) |
| 16 | 2, 15 | eqtrid 2776 | 1 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌Word 𝑥 = Word 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 {cab 2707 ∃wrex 3053 [wsbc 3753 ⦋csb 3862 ⟶wf 6507 (class class class)co 7387 0cc0 11068 ℕ0cn0 12442 ..^cfzo 13615 Word cword 14478 |
| 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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-fun 6513 df-fn 6514 df-f 6515 df-word 14479 |
| This theorem is referenced by: elovmpowrd 14523 |
| Copyright terms: Public domain | W3C validator |