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

Theorem nfwrd 13333
Description: Hypothesis builder for Word  S. (Contributed by Mario Carneiro, 26-Feb-2016.)
Hypothesis
Ref Expression
nfwrd.1  |-  F/_ x S
Assertion
Ref Expression
nfwrd  |-  F/_ xWord  S

Proof of Theorem nfwrd
Dummy variables  w  l are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-word 13299 . 2  |- Word  S  =  { w  |  E. l  e.  NN0  w : ( 0..^ l ) --> S }
2 nfcv 2764 . . . 4  |-  F/_ x NN0
3 nfcv 2764 . . . . 5  |-  F/_ x w
4 nfcv 2764 . . . . 5  |-  F/_ x
( 0..^ l )
5 nfwrd.1 . . . . 5  |-  F/_ x S
63, 4, 5nff 6041 . . . 4  |-  F/ x  w : ( 0..^ l ) --> S
72, 6nfrex 3007 . . 3  |-  F/ x E. l  e.  NN0  w : ( 0..^ l ) --> S
87nfab 2769 . 2  |-  F/_ x { w  |  E. l  e.  NN0  w : ( 0..^ l ) --> S }
91, 8nfcxfr 2762 1  |-  F/_ xWord  S
Colors of variables: wff setvar class
Syntax hints:   {cab 2608   F/_wnfc 2751   E.wrex 2913   -->wf 5884  (class class class)co 6650   0cc0 9936   NN0cn0 11292  ..^cfzo 12465  Word cword 13291
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654  df-opab 4713  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-fun 5890  df-fn 5891  df-f 5892  df-word 13299
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator