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

Theorem raluz2 12637
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 12588 . . . . . 6 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛))
2 3anass 1094 . . . . . 6 ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
31, 2bitri 274 . . . . 5 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
43imbi1i 350 . . . 4 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑))
5 impexp 451 . . . . . 6 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)))
6 impexp 451 . . . . . . 7 (((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑)))
76imbi2i 336 . . . . . 6 ((𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
85, 7bitri 274 . . . . 5 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
9 bi2.04 389 . . . . 5 ((𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
108, 9bitri 274 . . . 4 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
114, 10bitri 274 . . 3 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
1211ralbii2 3090 . 2 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)))
13 r19.21v 3113 . 2 (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
1412, 13bitri 274 1 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396  w3a 1086  wcel 2106  wral 3064   class class class wbr 5074  cfv 6433  cle 11010  cz 12319  cuz 12582
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-cnex 10927  ax-resscn 10928
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fv 6441  df-ov 7278  df-neg 11208  df-z 12320  df-uz 12583
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator