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

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

Proof of Theorem raluz2
StepHypRef Expression
1 eluz2 12765 . . . . . 6 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛))
2 3anass 1095 . . . . . 6 ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
31, 2bitri 274 . . . . 5 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
43imbi1i 349 . . . 4 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑))
5 impexp 451 . . . . . 6 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)))
6 impexp 451 . . . . . . 7 (((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑)))
76imbi2i 335 . . . . . 6 ((𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
85, 7bitri 274 . . . . 5 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
9 bi2.04 388 . . . . 5 ((𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
108, 9bitri 274 . . . 4 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
114, 10bitri 274 . . 3 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
1211ralbii2 3090 . 2 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)))
13 r19.21v 3174 . 2 (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
1412, 13bitri 274 1 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1087  wcel 2106  wral 3062   class class class wbr 5103  cfv 6493  cle 11186  cz 12495  cuz 12759
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 2707  ax-sep 5254  ax-nul 5261  ax-pr 5382  ax-cnex 11103  ax-resscn 11104
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 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2887  df-ral 3063  df-rex 3072  df-rab 3406  df-v 3445  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4281  df-if 4485  df-pw 4560  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4864  df-br 5104  df-opab 5166  df-mpt 5187  df-id 5529  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6445  df-fun 6495  df-fn 6496  df-f 6497  df-fv 6501  df-ov 7356  df-neg 11384  df-z 12496  df-uz 12760
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator