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

Theorem rexuz2 9649
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 9601 . . . . . 6  |-  ( n  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  n  e.  ZZ  /\  M  <_  n ) )
2 df-3an 982 . . . . . 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 561 . . . . . 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 2505 . 2  |-  ( E. n  e.  ( ZZ>= `  M ) ph  <->  E. n  e.  ZZ  ( M  e.  ZZ  /\  ( M  <_  n  /\  ph ) ) )
12 r19.42v 2651 . 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 980    e. wcel 2164   E.wrex 2473   class class class wbr 4030   ` cfv 5255    <_ cle 8057   ZZcz 9320   ZZ>=cuz 9595
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-cnex 7965  ax-resscn 7966
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2987  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-fv 5263  df-ov 5922  df-neg 8195  df-z 9321  df-uz 9596
This theorem is referenced by:  2rexuz  9650
  Copyright terms: Public domain W3C validator