Mathbox for Stefan O'Rear < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sbccomieg Structured version   Visualization version   Unicode version

Theorem sbccomieg 35707
 Description: Commute two explicit substitutions, using an implicit substitution to rewrite the exiting substitution. (Contributed by Stefan O'Rear, 11-Oct-2014.) (Revised by Mario Carneiro, 11-Dec-2016.)
Hypothesis
Ref Expression
sbccomieg.1
Assertion
Ref Expression
sbccomieg
Distinct variable groups:   ,,   ,
Allowed substitution hints:   (,)   (,)   ()

Proof of Theorem sbccomieg
StepHypRef Expression
1 sbcex 3265 . 2
2 spesbc 3337 . . 3
3 sbcex 3265 . . . 4
43exlimiv 1784 . . 3
52, 4syl 17 . 2
6 nfcv 2612 . . . 4
7 nfsbc1v 3275 . . . 4
86, 7nfsbc 3277 . . 3
9 sbccomieg.1 . . . 4
10 sbceq1a 3266 . . . 4
119, 10sbceqbid 3262 . . 3
128, 11sbciegf 3287 . 2
131, 5, 12pm5.21nii 360 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 189   wceq 1452  wex 1671   wcel 1904  cvv 3031  wsbc 3255 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451 This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ral 2761  df-rex 2762  df-v 3033  df-sbc 3256 This theorem is referenced by:  2rexfrabdioph  35710  3rexfrabdioph  35711  4rexfrabdioph  35712  6rexfrabdioph  35713  7rexfrabdioph  35714
 Copyright terms: Public domain W3C validator