ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  raluz2 GIF version

Theorem raluz2 9911
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 9859 . . . . . 6 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛))
2 3anass 1009 . . . . . 6 ((𝑀 ∈ ℤ ∧ 𝑛 ∈ ℤ ∧ 𝑀𝑛) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
31, 2bitri 184 . . . . 5 (𝑛 ∈ (ℤ𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)))
43imbi1i 238 . . . 4 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ ((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑))
5 impexp 263 . . . . . 6 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)))
6 impexp 263 . . . . . . 7 (((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀𝑛𝜑)))
76imbi2i 226 . . . . . 6 ((𝑀 ∈ ℤ → ((𝑛 ∈ ℤ ∧ 𝑀𝑛) → 𝜑)) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
85, 7bitri 184 . . . . 5 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))))
9 bi2.04 248 . . . . 5 ((𝑀 ∈ ℤ → (𝑛 ∈ ℤ → (𝑀𝑛𝜑))) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
108, 9bitri 184 . . . 4 (((𝑀 ∈ ℤ ∧ (𝑛 ∈ ℤ ∧ 𝑀𝑛)) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
114, 10bitri 184 . . 3 ((𝑛 ∈ (ℤ𝑀) → 𝜑) ↔ (𝑛 ∈ ℤ → (𝑀 ∈ ℤ → (𝑀𝑛𝜑))))
1211ralbii2 2552 . 2 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ ∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)))
13 r19.21v 2619 . 2 (∀𝑛 ∈ ℤ (𝑀 ∈ ℤ → (𝑀𝑛𝜑)) ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
1412, 13bitri 184 1 (∀𝑛 ∈ (ℤ𝑀)𝜑 ↔ (𝑀 ∈ ℤ → ∀𝑛 ∈ ℤ (𝑀𝑛𝜑)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005  wcel 2203  wral 2520   class class class wbr 4109  cfv 5352  cle 8309  cz 9577  cuz 9853
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-cnex 8218  ax-resscn 8219
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-ov 6053  df-neg 8447  df-z 9578  df-uz 9854
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator