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

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

Proof of Theorem rexuz2
StepHypRef Expression
1 eluz2 9760 . . . . . 6  |-  ( n  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  n  e.  ZZ  /\  M  <_  n ) )
2 df-3an 1006 . . . . . 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 ) )
43anbi1i 458 . . . 4  |-  ( ( n  e.  ( ZZ>= `  M )  /\  ph ) 
<->  ( ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  M  <_  n )  /\  ph ) )
5 anass 401 . . . . 5  |-  ( ( ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  M  <_  n )  /\  ph ) 
<->  ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  ( M  <_  n  /\  ph ) ) )
6 anass 401 . . . . . 6  |-  ( ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  ( M  <_  n  /\  ph ) )  <-> 
( M  e.  ZZ  /\  ( n  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) ) )
7 an12 563 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( n  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) )  <-> 
( n  e.  ZZ  /\  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) ) )
86, 7bitri 184 . . . . 5  |-  ( ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  ( M  <_  n  /\  ph ) )  <-> 
( n  e.  ZZ  /\  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) ) )
95, 8bitri 184 . . . 4  |-  ( ( ( ( M  e.  ZZ  /\  n  e.  ZZ )  /\  M  <_  n )  /\  ph ) 
<->  ( n  e.  ZZ  /\  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) ) )
104, 9bitri 184 . . 3  |-  ( ( n  e.  ( ZZ>= `  M )  /\  ph ) 
<->  ( n  e.  ZZ  /\  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) ) )
1110rexbii2 2543 . 2  |-  ( E. n  e.  ( ZZ>= `  M ) ph  <->  E. n  e.  ZZ  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) )
12 r19.42v 2690 . 2  |-  ( E. n  e.  ZZ  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) )  <->  ( M  e.  ZZ  /\  E. n  e.  ZZ  ( M  <_  n  /\  ph ) ) )
1311, 12bitri 184 1  |-  ( E. n  e.  ( ZZ>= `  M ) ph  <->  ( M  e.  ZZ  /\  E. n  e.  ZZ  ( M  <_  n  /\  ph ) ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    <-> wb 105    /\ w3a 1004    e. wcel 2202   E.wrex 2511   class class class wbr 4088   ` cfv 5326    <_ cle 8214   ZZcz 9478   ZZ>=cuz 9754
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-cnex 8122  ax-resscn 8123
This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-ov 6020  df-neg 8352  df-z 9479  df-uz 9755
This theorem is referenced by:  2rexuz  9815
  Copyright terms: Public domain W3C validator