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

Theorem raluz2 9979
Description: Restricted universal quantification in an upper set of integers. (Contributed by NM, 9-Sep-2005.)
Assertion
Ref Expression
raluz2  |-  ( A. n  e.  ( ZZ>= `  M ) ph  <->  ( M  e.  ZZ  ->  A. n  e.  ZZ  ( M  <_  n  ->  ph ) ) )
Distinct variable group:    n, M
Allowed substitution hint:    ph( n)

Proof of Theorem raluz2
StepHypRef Expression
1 eluz2 9927 . . . . . 6  |-  ( n  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  n  e.  ZZ  /\  M  <_  n ) )
2 3anass 1013 . . . . . 6  |-  ( ( M  e.  ZZ  /\  n  e.  ZZ  /\  M  <_  n )  <->  ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n ) ) )
31, 2bitri 184 . . . . 5  |-  ( n  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n ) ) )
43imbi1i 238 . . . 4  |-  ( ( n  e.  ( ZZ>= `  M )  ->  ph )  <->  ( ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n )
)  ->  ph ) )
5 impexp 263 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n )
)  ->  ph )  <->  ( M  e.  ZZ  ->  ( (
n  e.  ZZ  /\  M  <_  n )  ->  ph ) ) )
6 impexp 263 . . . . . . 7  |-  ( ( ( n  e.  ZZ  /\  M  <_  n )  ->  ph )  <->  ( n  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) )
76imbi2i 226 . . . . . 6  |-  ( ( M  e.  ZZ  ->  ( ( n  e.  ZZ  /\  M  <_  n )  ->  ph ) )  <->  ( M  e.  ZZ  ->  ( n  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) ) )
85, 7bitri 184 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n )
)  ->  ph )  <->  ( M  e.  ZZ  ->  ( n  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) ) )
9 bi2.04 248 . . . . 5  |-  ( ( M  e.  ZZ  ->  ( n  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) )  <->  ( n  e.  ZZ  ->  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) ) )
108, 9bitri 184 . . . 4  |-  ( ( ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  M  <_  n )
)  ->  ph )  <->  ( n  e.  ZZ  ->  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) ) )
114, 10bitri 184 . . 3  |-  ( ( n  e.  ( ZZ>= `  M )  ->  ph )  <->  ( n  e.  ZZ  ->  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) ) )
1211ralbii2 2560 . 2  |-  ( A. n  e.  ( ZZ>= `  M ) ph  <->  A. n  e.  ZZ  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) )
13 r19.21v 2627 . 2  |-  ( A. n  e.  ZZ  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) )  <->  ( M  e.  ZZ  ->  A. n  e.  ZZ  ( M  <_  n  ->  ph ) ) )
1412, 13bitri 184 1  |-  ( A. n  e.  ( ZZ>= `  M ) ph  <->  ( M  e.  ZZ  ->  A. n  e.  ZZ  ( M  <_  n  ->  ph ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1009    e. wcel 2209   A.wral 2528   class class class wbr 4130   ` cfv 5377    <_ cle 8361   ZZcz 9644   ZZ>=cuz 9921
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-cnex 8270  ax-resscn 8271
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-ov 6088  df-neg 8500  df-z 9645  df-uz 9922
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator