| 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 14423 | . . 3 ⊢ Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 2 | 1 | csbeq2i 3854 | . 2 ⊢ ⦋𝑆 / 𝑥⦌Word 𝑥 = ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} |
| 3 | sbcrex 3822 | . . . . 5 ⊢ ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥) | |
| 4 | sbcfg 6654 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥)) | |
| 5 | csbconstg 3865 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑤 = 𝑤) | |
| 6 | csbconstg 3865 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌(0..^𝑙) = (0..^𝑙)) | |
| 7 | csbvarg 4383 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑥 = 𝑆) | |
| 8 | 5, 6, 7 | feq123d 6645 | . . . . . . 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 2799 | . . 3 ⊢ (𝑆 ∈ 𝑉 → {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 13 | csbab 4389 | . . 3 ⊢ ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 14 | df-word 14423 | . . 3 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 15 | 12, 13, 14 | 3eqtr4g 2793 | . 2 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆) |
| 16 | 2, 15 | eqtrid 2780 | 1 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌Word 𝑥 = Word 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 {cab 2711 ∃wrex 3057 [wsbc 3737 ⦋csb 3846 ⟶wf 6482 (class class class)co 7352 0cc0 11013 ℕ0cn0 12388 ..^cfzo 13556 Word cword 14422 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pr 5372 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ral 3049 df-rex 3058 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-sn 4576 df-pr 4578 df-op 4582 df-br 5094 df-opab 5156 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-fun 6488 df-fn 6489 df-f 6490 df-word 14423 |
| This theorem is referenced by: elovmpowrd 14467 |
| Copyright terms: Public domain | W3C validator |