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

Theorem raluz 12288
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 12239 . . . 4 (𝑀 ∈ ℤ → (𝑛 ∈ (ℤ𝑀) ↔ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
21imbi1d 345 . . 3 (𝑀 ∈ ℤ → ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)))
3 impexp 454 . . 3 (((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑)))
42, 3syl6bb 290 . 2 (𝑀 ∈ ℤ → ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
54ralbidv2 3163 1 (𝑀 ∈ ℤ → (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 399  wcel 2112  wral 3109   class class class wbr 5033  cfv 6328  cle 10669  cz 11973  cuz 12235
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pr 5298  ax-cnex 10586  ax-resscn 10587
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-iota 6287  df-fun 6330  df-fv 6336  df-ov 7142  df-neg 10866  df-z 11974  df-uz 12236
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator