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

Theorem s1eqd 11308
Description: Equality theorem for a singleton word. (Contributed by Mario Carneiro, 26-Feb-2016.)
Hypothesis
Ref Expression
s1eqd.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
s1eqd  |-  ( ph  ->  <" A ">  =  <" B "> )

Proof of Theorem s1eqd
StepHypRef Expression
1 s1eqd.1 . 2  |-  ( ph  ->  A  =  B )
2 s1eq 11307 . 2  |-  ( A  =  B  ->  <" A ">  =  <" B "> )
31, 2syl 14 1  |-  ( ph  ->  <" A ">  =  <" B "> )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1398   <"cs1 11303
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 2214
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-rex 2526  df-v 2815  df-un 3215  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-iota 5312  df-fv 5360  df-s1 11304
This theorem is referenced by:  ccat1st1st  11329  swrds1  11360  swrdlsw  11361  reuccatpfxs1lem  11438  s2eqd  11462  s3eqd  11463  s4eqd  11464  s5eqd  11465  s6eqd  11466  s7eqd  11467  s8eqd  11468
  Copyright terms: Public domain W3C validator