MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  csbwrdg Structured version   Visualization version   GIF version

Theorem csbwrdg 14601
Description: Class substitution for the symbols of a word. (Contributed by Alexander van der Vekens, 15-Jul-2018.)
Assertion
Ref Expression
csbwrdg (𝑆𝑉𝑆 / 𝑥Word 𝑥 = Word 𝑆)
Distinct variable groups:   𝑥,𝑆   𝑥,𝑉

Proof of Theorem csbwrdg
Dummy variables 𝑙 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-word 14571 . . 3 Word 𝑥 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
21csbeq2i 3864 . 2 𝑆 / 𝑥Word 𝑥 = 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
3 sbcrex 3831 . . . . 5 ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥)
4 sbcfg 6710 . . . . . . 7 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥))
5 csbconstg 3875 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑤 = 𝑤)
6 csbconstg 3875 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥(0..^𝑙) = (0..^𝑙))
7 csbvarg 4402 . . . . . . . 8 (𝑆𝑉𝑆 / 𝑥𝑥 = 𝑆)
85, 6, 7feq123d 6701 . . . . . . 7 (𝑆𝑉 → (𝑆 / 𝑥𝑤:𝑆 / 𝑥(0..^𝑙)⟶𝑆 / 𝑥𝑥𝑤:(0..^𝑙)⟶𝑆))
94, 8bitrd 282 . . . . . 6 (𝑆𝑉 → ([𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥𝑤:(0..^𝑙)⟶𝑆))
109rexbidv 3192 . . . . 5 (𝑆𝑉 → (∃𝑙 ∈ ℕ0 [𝑆 / 𝑥]𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
113, 10bitrid 286 . . . 4 (𝑆𝑉 → ([𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥 ↔ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆))
1211abbidv 2832 . . 3 (𝑆𝑉 → {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
13 csbab 4408 . . 3 𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = {𝑤[𝑆 / 𝑥]𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥}
14 df-word 14571 . . 3 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
1512, 13, 143eqtr4g 2826 . 2 (𝑆𝑉𝑆 / 𝑥{𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑥} = Word 𝑆)
162, 15eqtrid 2813 1 (𝑆𝑉𝑆 / 𝑥Word 𝑥 = Word 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  {cab 2744  wrex 3092  [wsbc 3747  csb 3856  wf 6539  (class class class)co 7423  0cc0 11118  0cn0 12522  ..^cfzo 13701  Word cword 14570
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-fun 6545  df-fn 6546  df-f 6547  df-word 14571
This theorem is used by:  elovmpowrd  14615
  Copyright terms: Public domain W3C validator