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

Theorem poinxp 4762
Description: Intersection of partial order with cross product of its field. (Contributed by Mario Carneiro, 10-Jul-2014.)
Assertion
Ref Expression
poinxp  |-  ( R  Po  A  <->  ( R  i^i  ( A  X.  A
) )  Po  A
)

Proof of Theorem poinxp
Dummy variables  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 527 . . . . . . . 8  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  x  e.  A )
2 brinxp 4761 . . . . . . . 8  |-  ( ( x  e.  A  /\  x  e.  A )  ->  ( x R x  <-> 
x ( R  i^i  ( A  X.  A
) ) x ) )
31, 1, 2syl2anc 411 . . . . . . 7  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
x R x  <->  x ( R  i^i  ( A  X.  A ) ) x ) )
43notbid 669 . . . . . 6  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  ( -.  x R x  <->  -.  x
( R  i^i  ( A  X.  A ) ) x ) )
5 brinxp 4761 . . . . . . . . 9  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( x R y  <-> 
x ( R  i^i  ( A  X.  A
) ) y ) )
65adantr 276 . . . . . . . 8  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
x R y  <->  x ( R  i^i  ( A  X.  A ) ) y ) )
7 brinxp 4761 . . . . . . . . 9  |-  ( ( y  e.  A  /\  z  e.  A )  ->  ( y R z  <-> 
y ( R  i^i  ( A  X.  A
) ) z ) )
87adantll 476 . . . . . . . 8  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
y R z  <->  y ( R  i^i  ( A  X.  A ) ) z ) )
96, 8anbi12d 473 . . . . . . 7  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
( x R y  /\  y R z )  <->  ( x ( R  i^i  ( A  X.  A ) ) y  /\  y ( R  i^i  ( A  X.  A ) ) z ) ) )
10 brinxp 4761 . . . . . . . 8  |-  ( ( x  e.  A  /\  z  e.  A )  ->  ( x R z  <-> 
x ( R  i^i  ( A  X.  A
) ) z ) )
1110adantlr 477 . . . . . . 7  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
x R z  <->  x ( R  i^i  ( A  X.  A ) ) z ) )
129, 11imbi12d 234 . . . . . 6  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
( ( x R y  /\  y R z )  ->  x R z )  <->  ( (
x ( R  i^i  ( A  X.  A
) ) y  /\  y ( R  i^i  ( A  X.  A
) ) z )  ->  x ( R  i^i  ( A  X.  A ) ) z ) ) )
134, 12anbi12d 473 . . . . 5  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  (
( -.  x R x  /\  ( ( x R y  /\  y R z )  ->  x R z ) )  <-> 
( -.  x ( R  i^i  ( A  X.  A ) ) x  /\  ( ( x ( R  i^i  ( A  X.  A
) ) y  /\  y ( R  i^i  ( A  X.  A
) ) z )  ->  x ( R  i^i  ( A  X.  A ) ) z ) ) ) )
1413ralbidva 2504 . . . 4  |-  ( ( x  e.  A  /\  y  e.  A )  ->  ( A. z  e.  A  ( -.  x R x  /\  (
( x R y  /\  y R z )  ->  x R
z ) )  <->  A. z  e.  A  ( -.  x ( R  i^i  ( A  X.  A
) ) x  /\  ( ( x ( R  i^i  ( A  X.  A ) ) y  /\  y ( R  i^i  ( A  X.  A ) ) z )  ->  x
( R  i^i  ( A  X.  A ) ) z ) ) ) )
1514ralbidva 2504 . . 3  |-  ( x  e.  A  ->  ( A. y  e.  A  A. z  e.  A  ( -.  x R x  /\  ( ( x R y  /\  y R z )  ->  x R z ) )  <->  A. y  e.  A  A. z  e.  A  ( -.  x ( R  i^i  ( A  X.  A ) ) x  /\  ( ( x ( R  i^i  ( A  X.  A ) ) y  /\  y ( R  i^i  ( A  X.  A ) ) z )  ->  x
( R  i^i  ( A  X.  A ) ) z ) ) ) )
1615ralbiia 2522 . 2  |-  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  ( -.  x R x  /\  ( ( x R y  /\  y R z )  ->  x R z ) )  <->  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( -.  x ( R  i^i  ( A  X.  A ) ) x  /\  ( ( x ( R  i^i  ( A  X.  A ) ) y  /\  y ( R  i^i  ( A  X.  A ) ) z )  ->  x
( R  i^i  ( A  X.  A ) ) z ) ) )
17 df-po 4361 . 2  |-  ( R  Po  A  <->  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( -.  x R x  /\  (
( x R y  /\  y R z )  ->  x R
z ) ) )
18 df-po 4361 . 2  |-  ( ( R  i^i  ( A  X.  A ) )  Po  A  <->  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( -.  x ( R  i^i  ( A  X.  A
) ) x  /\  ( ( x ( R  i^i  ( A  X.  A ) ) y  /\  y ( R  i^i  ( A  X.  A ) ) z )  ->  x
( R  i^i  ( A  X.  A ) ) z ) ) )
1916, 17, 183bitr4i 212 1  |-  ( R  Po  A  <->  ( R  i^i  ( A  X.  A
) )  Po  A
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 104    <-> wb 105    e. wcel 2178   A.wral 2486    i^i cin 3173   class class class wbr 4059    Po wpo 4359    X. cxp 4691
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 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-14 2181  ax-ext 2189  ax-sep 4178  ax-pow 4234  ax-pr 4269
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-nf 1485  df-sb 1787  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ral 2491  df-rex 2492  df-v 2778  df-un 3178  df-in 3180  df-ss 3187  df-pw 3628  df-sn 3649  df-pr 3650  df-op 3652  df-br 4060  df-opab 4122  df-po 4361  df-xp 4699
This theorem is referenced by:  soinxp  4763
  Copyright terms: Public domain W3C validator