Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbcom2 Structured version   Unicode version

Theorem sbcom2 2190
 Description: Commutativity law for substitution. Used in proof of Theorem 9.7 of [Megill] p. 449 (p. 16 of the preprint). (Contributed by NM, 27-May-1997.) (Proof shortened by Wolf Lammen, 24-Sep-2018.)
Assertion
Ref Expression
sbcom2
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   (,,,)

Proof of Theorem sbcom2
Dummy variables are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ax6ev 1750 . 2
2 ax6ev 1750 . 2
3 2sb6 2189 . . . . . . . . . 10
4 alcom 1846 . . . . . . . . . 10
5 ancomst 452 . . . . . . . . . . 11
652albii 1642 . . . . . . . . . 10
73, 4, 63bitri 271 . . . . . . . . 9
8 2sb6 2189 . . . . . . . . 9
97, 8bitr4i 252 . . . . . . . 8
10 nfv 1708 . . . . . . . . 9
11 sbequ 2118 . . . . . . . . 9
1210, 11sbbid 2145 . . . . . . . 8
139, 12syl5bbr 259 . . . . . . 7
14 sbequ 2118 . . . . . . 7
1513, 14sylan9bb 699 . . . . . 6
16 nfv 1708 . . . . . . . 8
17 sbequ 2118 . . . . . . . 8
1816, 17sbbid 2145 . . . . . . 7
19 sbequ 2118 . . . . . . 7
2018, 19sylan9bbr 700 . . . . . 6
2115, 20bitr3d 255 . . . . 5
2221ex 434 . . . 4
2322exlimdv 1725 . . 3
2423exlimiv 1723 . 2
251, 2, 24mp2 9 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 184   wa 369  wal 1393  wex 1613  wsb 1740 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-ex 1614  df-nf 1618  df-sb 1741 This theorem is referenced by:  sbco4lem  2210  sbco4  2211  2mo  2373  2moOLD  2374  2eu6OLD  2384  cnvopab  5414
 Copyright terms: Public domain W3C validator