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

Theorem nfopd 3566
Description: Deduction version of bound-variable hypothesis builder nfop 3565. This shows how the deduction version of a not-free theorem such as nfop 3565 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 2183 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
2 nfaba1 2183 . . 3  |-  F/_ x { z  |  A. x  z  e.  B }
31, 2nfop 3565 . 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 2181 . . . . 5  |-  F/ x F/_ x A
7 nfnfc1 2181 . . . . 5  |-  F/ x F/_ x B
86, 7nfan 1457 . . . 4  |-  F/ x
( F/_ x A  /\  F/_ x B )
9 abidnf 2709 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
109adantr 261 . . . . 5  |-  ( (
F/_ x A  /\  F/_ x B )  ->  { z  |  A. x  z  e.  A }  =  A )
11 abidnf 2709 . . . . . 6  |-  ( F/_ x B  ->  { z  |  A. x  z  e.  B }  =  B )
1211adantl 262 . . . . 5  |-  ( (
F/_ x A  /\  F/_ x B )  ->  { z  |  A. x  z  e.  B }  =  B )
1310, 12opeq12d 3557 . . . 4  |-  ( (
F/_ x A  /\  F/_ x B )  ->  <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >.  =  <. A ,  B >. )
148, 13nfceqdf 2177 . . 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 391 . 2  |-  ( ph  ->  ( F/_ x <. { z  |  A. x  z  e.  A } ,  { z  |  A. x  z  e.  B } >. 
<-> 
F/_ x <. A ,  B >. ) )
163, 15mpbii 136 1  |-  ( ph  -> 
F/_ x <. A ,  B >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 97    <-> wb 98   A.wal 1241    = wceq 1243    e. wcel 1393   {cab 2026   F/_wnfc 2165   <.cop 3378
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-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384
This theorem is referenced by:  nfbrd  3807  nfovd  5534
  Copyright terms: Public domain W3C validator