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

Theorem csbopeq1a 6382
Description: Equality theorem for substitution of a class  A for an ordered pair  <. x ,  y >. in  B (analog of csbeq1a 3147). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
csbopeq1a  |-  ( A  =  <. x ,  y
>.  ->  [_ ( 1st `  A
)  /  x ]_ [_ ( 2nd `  A
)  /  y ]_ B  =  B )

Proof of Theorem csbopeq1a
StepHypRef Expression
1 vex 2816 . . . . 5  |-  x  e. 
_V
2 vex 2816 . . . . 5  |-  y  e. 
_V
31, 2op2ndd 6343 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  ( 2nd `  A
)  =  y )
43eqcomd 2238 . . 3  |-  ( A  =  <. x ,  y
>.  ->  y  =  ( 2nd `  A ) )
5 csbeq1a 3147 . . 3  |-  ( y  =  ( 2nd `  A
)  ->  B  =  [_ ( 2nd `  A
)  /  y ]_ B )
64, 5syl 14 . 2  |-  ( A  =  <. x ,  y
>.  ->  B  =  [_ ( 2nd `  A )  /  y ]_ B
)
71, 2op1std 6342 . . . 4  |-  ( A  =  <. x ,  y
>.  ->  ( 1st `  A
)  =  x )
87eqcomd 2238 . . 3  |-  ( A  =  <. x ,  y
>.  ->  x  =  ( 1st `  A ) )
9 csbeq1a 3147 . . 3  |-  ( x  =  ( 1st `  A
)  ->  [_ ( 2nd `  A )  /  y ]_ B  =  [_ ( 1st `  A )  /  x ]_ [_ ( 2nd `  A )  /  y ]_ B )
108, 9syl 14 . 2  |-  ( A  =  <. x ,  y
>.  ->  [_ ( 2nd `  A
)  /  y ]_ B  =  [_ ( 1st `  A )  /  x ]_ [_ ( 2nd `  A
)  /  y ]_ B )
116, 10eqtr2d 2266 1  |-  ( A  =  <. x ,  y
>.  ->  [_ ( 1st `  A
)  /  x ]_ [_ ( 2nd `  A
)  /  y ]_ B  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   [_csb 3138   <.cop 3692   ` cfv 5352   1stc1st 6332   2ndc2nd 6333
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-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-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-iota 5312  df-fun 5354  df-fv 5360  df-1st 6334  df-2nd 6335
This theorem is referenced by:  dfmpo  6419  f1od2  6431
  Copyright terms: Public domain W3C validator