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

Theorem iswrd 14663
Description: Property of being a word over a set with an existential quantifier over the length. (Contributed by Stefan O'Rear, 15-Aug-2015.) (Revised by Mario Carneiro, 26-Feb-2016.) (Proof shortened by AV, 13-May-2020.)
Assertion
Ref Expression
iswrd (𝑊 ∈ Word 𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆)
Distinct variable groups:   𝑆,𝑙   𝑊,𝑙

Proof of Theorem iswrd
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 df-word 14662 . . 3 Word 𝑆 = {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆}
21eleq2i 2852 . 2 (𝑊 ∈ Word 𝑆 ↔ 𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆})
3 ovex 7453 . . . . 5 (0..^𝑙) ∈ V
4 fex 7232 . . . . 5 ((𝑊:(0..^𝑙)⟶𝑆 ∧ (0..^𝑙) ∈ V) → 𝑊 ∈ V)
53, 4mpan2 704 . . . 4 (𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V)
65rexlimivw 3159 . . 3 (∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆 → 𝑊 ∈ V)
7 feq1 6687 . . . 4 (𝑤 = 𝑊 → (𝑤:(0..^𝑙)⟶𝑆 ↔ 𝑊:(0..^𝑙)⟶𝑆))
87rexbidv 3186 . . 3 (𝑤 = 𝑊 → (∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆))
96, 8elab3 3639 . 2 (𝑊 ∈ {𝑤 ∣ ∃𝑙 ∈ ℕ0 𝑤:(0..^𝑙)⟶𝑆} ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆)
102, 9bitri 278 1 (𝑊 ∈ Word 𝑆 ↔ ∃𝑙 ∈ ℕ0 𝑊:(0..^𝑙)⟶𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450  ⟶wf 6534  (class class class)co 7420  0cc0 11203  ℕ0cn0 12609  ..^cfzo 13791  Word cword 14661
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-word 14662
This theorem is used by:  iswrdi  14665  wrdf  14666  cshword  14946  motcgrg  29012  chnsubseqword  47981
  Copyright terms: Public domain W3C validator