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

Theorem disjwrdpfx 14656
Description: Sets of words are disjoint if each set contains exactly the extensions of distinct words of a fixed length. Remark: A word 𝑊 is called an "extension" of a word 𝑃 if 𝑃 is a prefix of 𝑊. (Contributed by AV, 29-Jul-2018.) (Revised by AV, 6-May-2020.)
Assertion
Ref Expression
disjwrdpfx Disj 𝑦𝑊 {𝑥 ∈ Word 𝑉 ∣ (𝑥 prefix 𝑁) = 𝑦}
Distinct variable groups:   𝑦,𝑁   𝑥,𝑉   𝑥,𝑦
Allowed substitution hints:   𝑁(𝑥)   𝑉(𝑦)   𝑊(𝑥,𝑦)

Proof of Theorem disjwrdpfx
StepHypRef Expression
1 invdisjrab 5127 1 Disj 𝑦𝑊 {𝑥 ∈ Word 𝑉 ∣ (𝑥 prefix 𝑁) = 𝑦}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1533  {crab 3426  Disj wdisj 5106  (class class class)co 7405  Word cword 14470   prefix cpfx 14626
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ral 3056  df-rmo 3370  df-rab 3427  df-v 3470  df-sbc 3773  df-csb 3889  df-disj 5107
This theorem is referenced by:  disjxwwlksn  29667  disjxwwlkn  29676
  Copyright terms: Public domain W3C validator