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

Theorem seqeq123d 10397
Description: Equality deduction for the sequence builder operation. (Contributed by Mario Carneiro, 7-Sep-2013.)
Hypotheses
Ref Expression
seqeq123d.1  |-  ( ph  ->  M  =  N )
seqeq123d.2  |-  ( ph  ->  .+  =  Q )
seqeq123d.3  |-  ( ph  ->  F  =  G )
Assertion
Ref Expression
seqeq123d  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq N ( Q ,  G ) )

Proof of Theorem seqeq123d
StepHypRef Expression
1 seqeq123d.1 . . 3  |-  ( ph  ->  M  =  N )
21seqeq1d 10394 . 2  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq N (  .+  ,  F ) )
3 seqeq123d.2 . . 3  |-  ( ph  ->  .+  =  Q )
43seqeq2d 10395 . 2  |-  ( ph  ->  seq N (  .+  ,  F )  =  seq N ( Q ,  F ) )
5 seqeq123d.3 . . 3  |-  ( ph  ->  F  =  G )
65seqeq3d 10396 . 2  |-  ( ph  ->  seq N ( Q ,  F )  =  seq N ( Q ,  G ) )
72, 4, 63eqtrd 2207 1  |-  ( ph  ->  seq M (  .+  ,  F )  =  seq N ( Q ,  G ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1348    seqcseq 10388
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152
This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-sn 3587  df-pr 3588  df-op 3590  df-uni 3795  df-br 3988  df-opab 4049  df-mpt 4050  df-cnv 4617  df-dm 4619  df-rn 4620  df-res 4621  df-iota 5158  df-fv 5204  df-ov 5853  df-oprab 5854  df-mpo 5855  df-recs 6281  df-frec 6367  df-seqfrec 10389
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator