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

Theorem nfimad 5091
Description: Deduction version of bound-variable hypothesis builder nfima 5090. (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 2381 . . 3  |-  F/_ x { z  |  A. x  z  e.  A }
2 nfaba1 2381 . . 3  |-  F/_ x { z  |  A. x  z  e.  B }
31, 2nfima 5090 . 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 2378 . . . . 5  |-  F/ x F/_ x A
7 nfnfc1 2378 . . . . 5  |-  F/ x F/_ x B
86, 7nfan 1614 . . . 4  |-  F/ x
( F/_ x A  /\  F/_ x B )
9 abidnf 2975 . . . . . 6  |-  ( F/_ x A  ->  { z  |  A. x  z  e.  A }  =  A )
109imaeq1d 5081 . . . . 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 2975 . . . . . 6  |-  ( F/_ x B  ->  { z  |  A. x  z  e.  B }  =  B )
1211imaeq2d 5082 . . . . 5  |-  ( F/_ x B  ->  ( A
" { z  | 
A. x  z  e.  B } )  =  ( A " B
) )
1310, 12sylan9eq 2284 . . . 4  |-  ( (
F/_ x A  /\  F/_ x B )  -> 
( { z  | 
A. x  z  e.  A } " {
z  |  A. x  z  e.  B }
)  =  ( A
" B ) )
148, 13nfceqdf 2374 . . 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 1396    e. wcel 2202   {cab 2217   F/_wnfc 2362   "cima 4734
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-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-rab 2520  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-xp 4737  df-cnv 4739  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator