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

Theorem pwjust 3657
Description: Soundness justification theorem for df-pw 3658. (Contributed by Rodolfo Medina, 28-Apr-2010.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)
Assertion
Ref Expression
pwjust  |-  { x  |  x  C_  A }  =  { y  |  y 
C_  A }
Distinct variable groups:    x, A    y, A

Proof of Theorem pwjust
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 sseq1 3251 . . 3  |-  ( x  =  z  ->  (
x  C_  A  <->  z  C_  A ) )
21cbvabv 2357 . 2  |-  { x  |  x  C_  A }  =  { z  |  z 
C_  A }
3 sseq1 3251 . . 3  |-  ( z  =  y  ->  (
z  C_  A  <->  y  C_  A ) )
43cbvabv 2357 . 2  |-  { z  |  z  C_  A }  =  { y  |  y  C_  A }
52, 4eqtri 2252 1  |-  { x  |  x  C_  A }  =  { y  |  y 
C_  A }
Colors of variables: wff set class
Syntax hints:    = wceq 1398   {cab 2217    C_ wss 3201
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-ext 2213
This theorem depends on definitions:  df-bi 117  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-in 3207  df-ss 3214
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator