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

Theorem poinxp 4732
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 4731 . . . . . . . 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 668 . . . . . 6  |-  ( ( ( x  e.  A  /\  y  e.  A
)  /\  z  e.  A )  ->  ( -.  x R x  <->  -.  x
( R  i^i  ( A  X.  A ) ) x ) )
5 brinxp 4731 . . . . . . . . 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 4731 . . . . . . . . 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 4731 . . . . . . . 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 2493 . . . 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 2493 . . 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 2511 . 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 4331 . 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 4331 . 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 2167   A.wral 2475    i^i cin 3156   class class class wbr 4033    Po wpo 4329    X. cxp 4661
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-po 4331  df-xp 4669
This theorem is referenced by:  soinxp  4733
  Copyright terms: Public domain W3C validator