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

Theorem nfopd 3796
Description: Deduction version of bound-variable hypothesis builder nfop 3795. This shows how the deduction version of a not-free theorem such as nfop 3795 can be created from the corresponding not-free inference theorem. (Contributed by NM, 4-Feb-2008.)
Hypotheses
Ref Expression
nfopd.2  |-  ( ph  -> 
F/_ x A )
nfopd.3  |-  ( ph  -> 
F/_ x B )
Assertion
Ref Expression
nfopd  |-  ( ph  -> 
F/_ x <. A ,  B >. )

Proof of Theorem nfopd
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 nfaba1 2325 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
2 nfaba1 2325 . . 3  |-  F/_ x { z  |  A. x  z  e.  B }
31, 2nfop 3795 . 2  |-  F/_ x <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >.
4 nfopd.2 . . 3  |-  ( ph  -> 
F/_ x A )
5 nfopd.3 . . 3  |-  ( ph  -> 
F/_ x B )
6 nfnfc1 2322 . . . . 5  |-  F/ x F/_ x A
7 nfnfc1 2322 . . . . 5  |-  F/ x F/_ x B
86, 7nfan 1565 . . . 4  |-  F/ x
( F/_ x A  /\  F/_ x B )
9 abidnf 2906 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
109adantr 276 . . . . 5  |-  ( (
F/_ x A  /\  F/_ x B )  ->  { z  |  A. x  z  e.  A }  =  A )
11 abidnf 2906 . . . . . 6  |-  ( F/_ x B  ->  { z  |  A. x  z  e.  B }  =  B )
1211adantl 277 . . . . 5  |-  ( (
F/_ x A  /\  F/_ x B )  ->  { z  |  A. x  z  e.  B }  =  B )
1310, 12opeq12d 3787 . . . 4  |-  ( (
F/_ x A  /\  F/_ x B )  ->  <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >.  =  <. A ,  B >. )
148, 13nfceqdf 2318 . . 3  |-  ( (
F/_ x A  /\  F/_ x B )  -> 
( F/_ x <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >. 
<-> 
F/_ x <. A ,  B >. ) )
154, 5, 14syl2anc 411 . 2  |-  ( ph  ->  ( F/_ x <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >. 
<-> 
F/_ x <. A ,  B >. ) )
163, 15mpbii 148 1  |-  ( ph  -> 
F/_ x <. A ,  B >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1351    = wceq 1353    e. wcel 2148   {cab 2163   F/_wnfc 2306   <.cop 3596
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2740  df-un 3134  df-sn 3599  df-pr 3600  df-op 3602
This theorem is referenced by:  nfbrd  4049  nfovd  5904
  Copyright terms: Public domain W3C validator