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

Theorem uzin2 10766
Description: The upper integers are closed under intersection. (Contributed by Mario Carneiro, 24-Dec-2013.)
Assertion
Ref Expression
uzin2  |-  ( ( A  e.  ran  ZZ>=  /\  B  e.  ran  ZZ>= )  -> 
( A  i^i  B
)  e.  ran  ZZ>= )

Proof of Theorem uzin2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 uzf 9336 . . . 4  |-  ZZ>= : ZZ --> ~P ZZ
2 ffn 5272 . . . 4  |-  ( ZZ>= : ZZ --> ~P ZZ  ->  ZZ>=  Fn  ZZ )
31, 2ax-mp 5 . . 3  |-  ZZ>=  Fn  ZZ
4 fvelrnb 5469 . . 3  |-  ( ZZ>=  Fn  ZZ  ->  ( A  e.  ran  ZZ>= 
<->  E. x  e.  ZZ  ( ZZ>= `  x )  =  A ) )
53, 4ax-mp 5 . 2  |-  ( A  e.  ran  ZZ>=  <->  E. x  e.  ZZ  ( ZZ>= `  x
)  =  A )
6 fvelrnb 5469 . . 3  |-  ( ZZ>=  Fn  ZZ  ->  ( B  e.  ran  ZZ>= 
<->  E. y  e.  ZZ  ( ZZ>= `  y )  =  B ) )
73, 6ax-mp 5 . 2  |-  ( B  e.  ran  ZZ>=  <->  E. y  e.  ZZ  ( ZZ>= `  y
)  =  B )
8 ineq1 3270 . . 3  |-  ( (
ZZ>= `  x )  =  A  ->  ( ( ZZ>=
`  x )  i^i  ( ZZ>= `  y )
)  =  ( A  i^i  ( ZZ>= `  y
) ) )
98eleq1d 2208 . 2  |-  ( (
ZZ>= `  x )  =  A  ->  ( (
( ZZ>= `  x )  i^i  ( ZZ>= `  y )
)  e.  ran  ZZ>=  <->  ( A  i^i  ( ZZ>= `  y )
)  e.  ran  ZZ>= ) )
10 ineq2 3271 . . 3  |-  ( (
ZZ>= `  y )  =  B  ->  ( A  i^i  ( ZZ>= `  y )
)  =  ( A  i^i  B ) )
1110eleq1d 2208 . 2  |-  ( (
ZZ>= `  y )  =  B  ->  ( ( A  i^i  ( ZZ>= `  y
) )  e.  ran  ZZ>=  <->  ( A  i^i  B )  e. 
ran  ZZ>= ) )
12 uzin 9365 . . 3  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  ( ( ZZ>= `  x
)  i^i  ( ZZ>= `  y ) )  =  ( ZZ>= `  if (
x  <_  y , 
y ,  x ) ) )
13 simpr 109 . . . . 5  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  y  e.  ZZ )
14 simpl 108 . . . . 5  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  x  e.  ZZ )
15 zdcle 9134 . . . . 5  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  -> DECID  x  <_  y )
1613, 14, 15ifcldcd 3507 . . . 4  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  if ( x  <_ 
y ,  y ,  x )  e.  ZZ )
17 fnfvelrn 5552 . . . 4  |-  ( (
ZZ>=  Fn  ZZ  /\  if ( x  <_  y ,  y ,  x )  e.  ZZ )  -> 
( ZZ>= `  if (
x  <_  y , 
y ,  x ) )  e.  ran  ZZ>= )
183, 16, 17sylancr 410 . . 3  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  ( ZZ>= `  if (
x  <_  y , 
y ,  x ) )  e.  ran  ZZ>= )
1912, 18eqeltrd 2216 . 2  |-  ( ( x  e.  ZZ  /\  y  e.  ZZ )  ->  ( ( ZZ>= `  x
)  i^i  ( ZZ>= `  y ) )  e. 
ran  ZZ>= )
205, 7, 9, 11, 192gencl 2719 1  |-  ( ( A  e.  ran  ZZ>=  /\  B  e.  ran  ZZ>= )  -> 
( A  i^i  B
)  e.  ran  ZZ>= )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331    e. wcel 1480   E.wrex 2417    i^i cin 3070   ifcif 3474   ~Pcpw 3510   class class class wbr 3929   ran crn 4540    Fn wfn 5118   -->wf 5119   ` cfv 5123    <_ cle 7808   ZZcz 9061   ZZ>=cuz 9333
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7718  ax-resscn 7719  ax-1cn 7720  ax-1re 7721  ax-icn 7722  ax-addcl 7723  ax-addrcl 7724  ax-mulcl 7725  ax-addcom 7727  ax-addass 7729  ax-distr 7731  ax-i2m1 7732  ax-0lt1 7733  ax-0id 7735  ax-rnegex 7736  ax-cnre 7738  ax-pre-ltirr 7739  ax-pre-ltwlin 7740  ax-pre-lttrn 7741  ax-pre-apti 7742  ax-pre-ltadd 7743
This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-nel 2404  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-if 3475  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-int 3772  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-riota 5730  df-ov 5777  df-oprab 5778  df-mpo 5779  df-pnf 7809  df-mnf 7810  df-xr 7811  df-ltxr 7812  df-le 7813  df-sub 7942  df-neg 7943  df-inn 8728  df-n0 8985  df-z 9062  df-uz 9334
This theorem is referenced by:  rexanuz  10767
  Copyright terms: Public domain W3C validator