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

Theorem nfimad 4981
Description: Deduction version of bound-variable hypothesis builder nfima 4980. (Contributed by FL, 15-Dec-2006.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nfimad.2  |-  ( ph  -> 
F/_ x A )
nfimad.3  |-  ( ph  -> 
F/_ x B )
Assertion
Ref Expression
nfimad  |-  ( ph  -> 
F/_ x ( A
" B ) )

Proof of Theorem nfimad
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, 2nfima 4980 . 2  |-  F/_ x
( { z  | 
A. x  z  e.  A } " {
z  |  A. x  z  e.  B }
)
4 nfimad.2 . . 3  |-  ( ph  -> 
F/_ x A )
5 nfimad.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 2907 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
109imaeq1d 4971 . . . . 5  |-  ( F/_ x A  ->  ( { z  |  A. x  z  e.  A } " { z  |  A. x  z  e.  B } )  =  ( A " { z  |  A. x  z  e.  B } ) )
11 abidnf 2907 . . . . . 6  |-  ( F/_ x B  ->  { z  |  A. x  z  e.  B }  =  B )
1211imaeq2d 4972 . . . . 5  |-  ( F/_ x B  ->  ( A
" { z  | 
A. x  z  e.  B } )  =  ( A " B
) )
1310, 12sylan9eq 2230 . . . 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    e. wcel 2148   {cab 2163   F/_wnfc 2306   "cima 4631
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-rab 2464  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-opab 4067  df-xp 4634  df-cnv 4636  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator