MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  swopolem Structured version   Visualization version   Unicode version

Theorem swopolem 5044
Description: Perform the substitutions into the strict weak ordering law. (Contributed by Mario Carneiro, 31-Dec-2014.)
Hypothesis
Ref Expression
swopolem.1  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  A  /\  z  e.  A ) )  -> 
( x R y  ->  ( x R z  \/  z R y ) ) )
Assertion
Ref Expression
swopolem  |-  ( (
ph  /\  ( X  e.  A  /\  Y  e.  A  /\  Z  e.  A ) )  -> 
( X R Y  ->  ( X R Z  \/  Z R Y ) ) )
Distinct variable groups:    x, y,
z, A    ph, x, y, z    x, R, y, z    x, X, y, z    y, Y, z   
z, Z
Allowed substitution hints:    Y( x)    Z( x, y)

Proof of Theorem swopolem
StepHypRef Expression
1 swopolem.1 . . 3  |-  ( (
ph  /\  ( x  e.  A  /\  y  e.  A  /\  z  e.  A ) )  -> 
( x R y  ->  ( x R z  \/  z R y ) ) )
21ralrimivvva 2972 . 2  |-  ( ph  ->  A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) ) )
3 breq1 4656 . . . 4  |-  ( x  =  X  ->  (
x R y  <->  X R
y ) )
4 breq1 4656 . . . . 5  |-  ( x  =  X  ->  (
x R z  <->  X R
z ) )
54orbi1d 739 . . . 4  |-  ( x  =  X  ->  (
( x R z  \/  z R y )  <->  ( X R z  \/  z R y ) ) )
63, 5imbi12d 334 . . 3  |-  ( x  =  X  ->  (
( x R y  ->  ( x R z  \/  z R y ) )  <->  ( X R y  ->  ( X R z  \/  z R y ) ) ) )
7 breq2 4657 . . . 4  |-  ( y  =  Y  ->  ( X R y  <->  X R Y ) )
8 breq2 4657 . . . . 5  |-  ( y  =  Y  ->  (
z R y  <->  z R Y ) )
98orbi2d 738 . . . 4  |-  ( y  =  Y  ->  (
( X R z  \/  z R y )  <->  ( X R z  \/  z R Y ) ) )
107, 9imbi12d 334 . . 3  |-  ( y  =  Y  ->  (
( X R y  ->  ( X R z  \/  z R y ) )  <->  ( X R Y  ->  ( X R z  \/  z R Y ) ) ) )
11 breq2 4657 . . . . 5  |-  ( z  =  Z  ->  ( X R z  <->  X R Z ) )
12 breq1 4656 . . . . 5  |-  ( z  =  Z  ->  (
z R Y  <->  Z R Y ) )
1311, 12orbi12d 746 . . . 4  |-  ( z  =  Z  ->  (
( X R z  \/  z R Y )  <->  ( X R Z  \/  Z R Y ) ) )
1413imbi2d 330 . . 3  |-  ( z  =  Z  ->  (
( X R Y  ->  ( X R z  \/  z R Y ) )  <->  ( X R Y  ->  ( X R Z  \/  Z R Y ) ) ) )
156, 10, 14rspc3v 3325 . 2  |-  ( ( X  e.  A  /\  Y  e.  A  /\  Z  e.  A )  ->  ( A. x  e.  A  A. y  e.  A  A. z  e.  A  ( x R y  ->  ( x R z  \/  z R y ) )  ->  ( X R Y  ->  ( X R Z  \/  Z R Y ) ) ) )
162, 15mpan9 486 1  |-  ( (
ph  /\  ( X  e.  A  /\  Y  e.  A  /\  Z  e.  A ) )  -> 
( X R Y  ->  ( X R Z  \/  Z R Y ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    \/ wo 383    /\ wa 384    /\ w3a 1037    = wceq 1483    e. wcel 1990   A.wral 2912   class class class wbr 4653
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-br 4654
This theorem is referenced by:  swoer  7772  swoord1  7773  swoord2  7774
  Copyright terms: Public domain W3C validator