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

Theorem poirr2 5160
Description: A partial order relation is irreflexive. (Contributed by Mario Carneiro, 2-Nov-2015.)
Assertion
Ref Expression
poirr2  |-  ( R  Po  A  ->  ( R  i^i  (  _I  |`  A ) )  =  (/) )

Proof of Theorem poirr2
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 5071 . . . 4  |-  Rel  (  _I  |`  A )
2 relin2 4876 . . . 4  |-  ( Rel  (  _I  |`  A )  ->  Rel  ( R  i^i  (  _I  |`  A ) ) )
31, 2mp1i 10 . . 3  |-  ( R  Po  A  ->  Rel  ( R  i^i  (  _I  |`  A ) ) )
4 df-br 4115 . . . . 5  |-  ( x ( R  i^i  (  _I  |`  A ) ) y  <->  <. x ,  y
>.  e.  ( R  i^i  (  _I  |`  A ) ) )
5 brin 4167 . . . . 5  |-  ( x ( R  i^i  (  _I  |`  A ) ) y  <->  ( x R y  /\  x (  _I  |`  A )
y ) )
64, 5bitr3i 186 . . . 4  |-  ( <.
x ,  y >.  e.  ( R  i^i  (  _I  |`  A ) )  <-> 
( x R y  /\  x (  _I  |`  A ) y ) )
7 vex 2818 . . . . . . . . 9  |-  y  e. 
_V
87brres 5049 . . . . . . . 8  |-  ( x (  _I  |`  A ) y  <->  ( x  _I  y  /\  x  e.  A ) )
9 poirr 4433 . . . . . . . . . . 11  |-  ( ( R  Po  A  /\  x  e.  A )  ->  -.  x R x )
107ideq 4912 . . . . . . . . . . . . 13  |-  ( x  _I  y  <->  x  =  y )
11 breq2 4118 . . . . . . . . . . . . 13  |-  ( x  =  y  ->  (
x R x  <->  x R
y ) )
1210, 11sylbi 121 . . . . . . . . . . . 12  |-  ( x  _I  y  ->  (
x R x  <->  x R
y ) )
1312notbid 673 . . . . . . . . . . 11  |-  ( x  _I  y  ->  ( -.  x R x  <->  -.  x R y ) )
149, 13syl5ibcom 155 . . . . . . . . . 10  |-  ( ( R  Po  A  /\  x  e.  A )  ->  ( x  _I  y  ->  -.  x R y ) )
1514expimpd 363 . . . . . . . . 9  |-  ( R  Po  A  ->  (
( x  e.  A  /\  x  _I  y
)  ->  -.  x R y ) )
1615ancomsd 269 . . . . . . . 8  |-  ( R  Po  A  ->  (
( x  _I  y  /\  x  e.  A
)  ->  -.  x R y ) )
178, 16biimtrid 152 . . . . . . 7  |-  ( R  Po  A  ->  (
x (  _I  |`  A ) y  ->  -.  x R y ) )
1817con2d 629 . . . . . 6  |-  ( R  Po  A  ->  (
x R y  ->  -.  x (  _I  |`  A ) y ) )
19 imnan 697 . . . . . 6  |-  ( ( x R y  ->  -.  x (  _I  |`  A ) y )  <->  -.  (
x R y  /\  x (  _I  |`  A ) y ) )
2018, 19sylib 122 . . . . 5  |-  ( R  Po  A  ->  -.  ( x R y  /\  x (  _I  |`  A ) y ) )
2120pm2.21d 624 . . . 4  |-  ( R  Po  A  ->  (
( x R y  /\  x (  _I  |`  A ) y )  ->  <. x ,  y
>.  e.  (/) ) )
226, 21biimtrid 152 . . 3  |-  ( R  Po  A  ->  ( <. x ,  y >.  e.  ( R  i^i  (  _I  |`  A ) )  ->  <. x ,  y
>.  e.  (/) ) )
233, 22relssdv 4847 . 2  |-  ( R  Po  A  ->  ( R  i^i  (  _I  |`  A ) )  C_  (/) )
24 ss0 3553 . 2  |-  ( ( R  i^i  (  _I  |`  A ) )  C_  (/) 
->  ( R  i^i  (  _I  |`  A ) )  =  (/) )
2523, 24syl 14 1  |-  ( R  Po  A  ->  ( R  i^i  (  _I  |`  A ) )  =  (/) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205    i^i cin 3213    C_ wss 3214   (/)c0 3512   <.cop 3697   class class class wbr 4114    _I cid 4414    Po wpo 4420    |` cres 4756   Rel wrel 4759
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-in1 619  ax-in2 620  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
This theorem depends on definitions:  df-bi 117  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-v 2817  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-br 4115  df-opab 4177  df-id 4419  df-po 4422  df-xp 4760  df-rel 4761  df-res 4766
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator