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

Theorem swrdnznd 13732
 Description: The value of a subword operation for noninteger arguments is the empty set. (This is due to our definition of function values for out-of-domain arguments, see ndmfv 6476). (Contributed by AV, 2-Dec-2022.) (New usage is discouraged.)
Assertion
Ref Expression
swrdnznd (¬ (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ) → (𝑆 substr ⟨𝐹, 𝐿⟩) = ∅)

Proof of Theorem swrdnznd
Dummy variables 𝑠 𝑏 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 opelxp 5391 . . . . 5 (⟨𝐹, 𝐿⟩ ∈ (ℤ × ℤ) ↔ (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ))
21biimpi 208 . . . 4 (⟨𝐹, 𝐿⟩ ∈ (ℤ × ℤ) → (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ))
32adantl 475 . . 3 ((𝑆 ∈ V ∧ ⟨𝐹, 𝐿⟩ ∈ (ℤ × ℤ)) → (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ))
43con3i 152 . 2 (¬ (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ) → ¬ (𝑆 ∈ V ∧ ⟨𝐹, 𝐿⟩ ∈ (ℤ × ℤ)))
5 df-substr 13731 . . 3 substr = (𝑠 ∈ V, 𝑏 ∈ (ℤ × ℤ) ↦ if(((1st𝑏)..^(2nd𝑏)) ⊆ dom 𝑠, (𝑥 ∈ (0..^((2nd𝑏) − (1st𝑏))) ↦ (𝑠‘(𝑥 + (1st𝑏)))), ∅))
65mpt2ndm0 7152 . 2 (¬ (𝑆 ∈ V ∧ ⟨𝐹, 𝐿⟩ ∈ (ℤ × ℤ)) → (𝑆 substr ⟨𝐹, 𝐿⟩) = ∅)
74, 6syl 17 1 (¬ (𝐹 ∈ ℤ ∧ 𝐿 ∈ ℤ) → (𝑆 substr ⟨𝐹, 𝐿⟩) = ∅)
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 386   = wceq 1601   ∈ wcel 2107  Vcvv 3398   ⊆ wss 3792  ∅c0 4141  ifcif 4307  ⟨cop 4404   ↦ cmpt 4965   × cxp 5353  dom cdm 5355  ‘cfv 6135  (class class class)co 6922  1st c1st 7443  2nd c2nd 7444  0cc0 10272   + caddc 10275   − cmin 10606  ℤcz 11728  ..^cfzo 12784   substr csubstr 13730 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1839  ax-4 1853  ax-5 1953  ax-6 2021  ax-7 2055  ax-8 2109  ax-9 2116  ax-10 2135  ax-11 2150  ax-12 2163  ax-13 2334  ax-ext 2754  ax-sep 5017  ax-nul 5025  ax-pow 5077  ax-pr 5138 This theorem depends on definitions:  df-bi 199  df-an 387  df-or 837  df-3an 1073  df-tru 1605  df-ex 1824  df-nf 1828  df-sb 2012  df-mo 2551  df-eu 2587  df-clab 2764  df-cleq 2770  df-clel 2774  df-nfc 2921  df-ral 3095  df-rex 3096  df-rab 3099  df-v 3400  df-dif 3795  df-un 3797  df-in 3799  df-ss 3806  df-nul 4142  df-if 4308  df-sn 4399  df-pr 4401  df-op 4405  df-uni 4672  df-br 4887  df-opab 4949  df-xp 5361  df-dm 5365  df-iota 6099  df-fv 6143  df-ov 6925  df-oprab 6926  df-mpt2 6927  df-substr 13731 This theorem is referenced by:  swrdnnn0nd  13751
 Copyright terms: Public domain W3C validator