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

Theorem opabid 4273
 Description: The law of concretion. Special case of Theorem 9.5 of [Quine] p. 61. (Contributed by NM, 14-Apr-1995.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
opabid

Proof of Theorem opabid
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 opex 4239 . 2
2 copsexg 4254 . . 3
32bicomd 192 . 2
4 df-opab 4080 . 2
51, 3, 4elab2 2919 1
 Colors of variables: wff set class Syntax hints:   wb 176   wa 358  wex 1530   wceq 1625   wcel 1686  cop 3645  copab 4078 This theorem is referenced by:  opelopabsb  4277  ssopab2b  4293  dmopab  4891  rnopab  4926  funopab  5289  f1ompt  5684  zfrep6  5750  ovid  5966  fvopab5  6291  opabiota  6295  enssdom  6888  omxpenlem  6965  infxpenlem  7643  canthwelem  8274  pospo  14109  2ndcdisj  17184  lgsquadlem1  20595  lgsquadlem2  20596  h2hlm  21562  bosser  26178  diclspsn  31457 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1637  ax-8 1645  ax-14 1690  ax-6 1705  ax-7 1710  ax-11 1717  ax-12 1868  ax-ext 2266  ax-sep 4143  ax-nul 4151  ax-pr 4216 This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1531  df-nf 1534  df-sb 1632  df-eu 2149  df-mo 2150  df-clab 2272  df-cleq 2278  df-clel 2281  df-nfc 2410  df-ne 2450  df-rab 2554  df-v 2792  df-dif 3157  df-un 3159  df-in 3161  df-ss 3168  df-nul 3458  df-if 3568  df-sn 3648  df-pr 3649  df-op 3651  df-opab 4080
 Copyright terms: Public domain W3C validator