| 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 14449 | . . 3 ⊢ Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 2 | 1 | csbeq2i 3859 | . 2 ⊢ ⦋𝑆 / 𝑥⦌Word 𝑥 = ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} |
| 3 | sbcrex 3827 | . . . . 5 ⊢ ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥) | |
| 4 | sbcfg 6668 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥)) | |
| 5 | csbconstg 3870 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑤 = 𝑤) | |
| 6 | csbconstg 3870 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌(0..^𝑙) = (0..^𝑙)) | |
| 7 | csbvarg 4388 | . . . . . . . 8 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌𝑥 = 𝑆) | |
| 8 | 5, 6, 7 | feq123d 6659 | . . . . . . 7 ⊢ (𝑆 ∈ 𝑉 → (⦋𝑆 / 𝑥⦌𝑤:⦋𝑆 / 𝑥⦌(0..^𝑙)⟶⦋𝑆 / 𝑥⦌𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 9 | 4, 8 | bitrd 279 | . . . . . 6 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ 𝑤:(0..^𝑙)⟶𝑆)) |
| 10 | 9 | rexbidv 3162 | . . . . 5 ⊢ (𝑆 ∈ 𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 11 | 3, 10 | bitrid 283 | . . . 4 ⊢ (𝑆 ∈ 𝑉 → ([𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆)) |
| 12 | 11 | abbidv 2803 | . . 3 ⊢ (𝑆 ∈ 𝑉 → {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}) |
| 13 | csbab 4394 | . . 3 ⊢ ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ [𝑆 / 𝑥]∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} | |
| 14 | df-word 14449 | . . 3 ⊢ Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} | |
| 15 | 12, 13, 14 | 3eqtr4g 2797 | . 2 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆) |
| 16 | 2, 15 | eqtrid 2784 | 1 ⊢ (𝑆 ∈ 𝑉 → ⦋𝑆 / 𝑥⦌Word 𝑥 = Word 𝑆) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 {cab 2715 ∃wrex 3062 [wsbc 3742 ⦋csb 3851 ⟶wf 6496 (class class class)co 7368 0cc0 11038 ℕ0cn0 12413 ..^cfzo 13582 Word cword 14448 |
| 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-sep 5243 ax-pr 5379 |
| 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-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-fun 6502 df-fn 6503 df-f 6504 df-word 14449 |
| This theorem is referenced by: elovmpowrd 14493 |
| Copyright terms: Public domain | W3C validator |