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

Theorem abbid 2151
Description: Equivalent wff's yield equal class abstractions (deduction rule). (Contributed by NM, 5-Aug-1993.) (Revised by Mario Carneiro, 7-Oct-2016.)
Hypotheses
Ref Expression
abbid.1  F/
abbid.2
Assertion
Ref Expression
abbid  {  |  }  {  |  }

Proof of Theorem abbid
StepHypRef Expression
1 abbid.1 . . 3  F/
2 abbid.2 . . 3
31, 2alrimi 1412 . 2
4 abbi 2148 . 2  {  |  }  {  |  }
53, 4sylib 127 1  {  |  }  {  |  }
Colors of variables: wff set class
Syntax hints:   wi 4   wb 98  wal 1240   wceq 1242   F/wnf 1346   {cab 2023
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-11 1394  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019
This theorem depends on definitions:  df-bi 110  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030
This theorem is referenced by:  abbidv  2152  rabeqf  2544  sbcbid  2810
  Copyright terms: Public domain W3C validator