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

Theorem raluz2 9929
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 9877 . . . . . 6  |-  ( n  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  n  e.  ZZ  /\  M  <_  n ) )
2 3anass 1009 . . . . . 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 2554 . 2  |-  ( A. n  e.  ( ZZ>= `  M ) ph  <->  A. n  e.  ZZ  ( M  e.  ZZ  ->  ( M  <_  n  ->  ph ) ) )
13 r19.21v 2621 . 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
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1005    e. wcel 2205   A.wral 2522   class class class wbr 4114   ` cfv 5357    <_ cle 8325   ZZcz 9594   ZZ>=cuz 9871
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 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-cnex 8234  ax-resscn 8235
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fv 5365  df-ov 6061  df-neg 8463  df-z 9595  df-uz 9872
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator