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

Theorem opabidw 4357
Description: The law of concretion. Special case of Theorem 9.5 of [Quine] p. 61. Version of opabid 4356 with a disjoint variable condition. (Contributed by NM, 14-Apr-1995.) (Revised by GG, 26-Jan-2024.)
Assertion
Ref Expression
opabidw  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ph }  <->  ph )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem opabidw
StepHypRef Expression
1 opabid 4356 1  |-  ( <.
x ,  y >.  e.  { <. x ,  y
>.  |  ph }  <->  ph )
Colors of variables: wff set class
Syntax hints:    <-> wb 105    e. wcel 2202   <.cop 3676   {copab 4154
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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-opab 4156
This theorem is referenced by:  lgsquadlem1  15876  lgsquadlem2  15877
  Copyright terms: Public domain W3C validator