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

Theorem raluz 12879
Description: Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
Assertion
Ref Expression
raluz (𝑀 ∈ ℤ → (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Distinct variable group:   𝑛,𝑀
Allowed substitution hint:   𝜑(𝑛)

Proof of Theorem raluz
StepHypRef Expression
1 eluz1 12825 . . . 4 (𝑀 ∈ ℤ → (𝑛 ∈ (ℤ𝑀) ↔ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
21imbi1d 341 . . 3 (𝑀 ∈ ℤ → ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)))
3 impexp 451 . . 3 (((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑)))
42, 3bitrdi 286 . 2 (𝑀 ∈ ℤ → ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
54ralbidv2 3173 1 (𝑀 ∈ ℤ → (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  wcel 2106  wral 3061   class class class wbr 5148  cfv 6543  cle 11248  cz 12557  cuz 12821
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427  ax-cnex 11165  ax-resscn 11166
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-iota 6495  df-fun 6545  df-fv 6551  df-ov 7411  df-neg 11446  df-z 12558  df-uz 12822
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator