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

Theorem isarep2 5424
Description: Part of a study of the Axiom of Replacement used by the Isabelle prover. In Isabelle, the sethood of PrimReplace is apparently postulated implicitly by its type signature " [ i, 
[ i, i  ] => o  ] => i", which automatically asserts that it is a set without using any axioms. To prove that it is a set in Metamath, we need the hypotheses of Isabelle's "Axiom of Replacement" as well as the Axiom of Replacement in the form funimaex 5422. (Contributed by NM, 26-Oct-2006.)
Hypotheses
Ref Expression
isarep2.1  |-  A  e. 
_V
isarep2.2  |-  A. x  e.  A  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z )
Assertion
Ref Expression
isarep2  |-  E. w  w  =  ( { <. x ,  y >.  |  ph } " A
)
Distinct variable groups:    x, w, y, A    y, z    ph, w    ph, z
Allowed substitution hints:    ph( x, y)    A( z)

Proof of Theorem isarep2
StepHypRef Expression
1 resima 5052 . . . 4  |-  ( ( { <. x ,  y
>.  |  ph }  |`  A )
" A )  =  ( { <. x ,  y >.  |  ph } " A )
2 resopab 5063 . . . . 5  |-  ( {
<. x ,  y >.  |  ph }  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
32imaeq1i 5079 . . . 4  |-  ( ( { <. x ,  y
>.  |  ph }  |`  A )
" A )  =  ( { <. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A
)
41, 3eqtr3i 2254 . . 3  |-  ( {
<. x ,  y >.  |  ph } " A
)  =  ( {
<. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A )
5 funopab 5368 . . . . 5  |-  ( Fun 
{ <. x ,  y
>.  |  ( x  e.  A  /\  ph ) } 
<-> 
A. x E* y
( x  e.  A  /\  ph ) )
6 isarep2.2 . . . . . . . 8  |-  A. x  e.  A  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z )
76rspec 2585 . . . . . . 7  |-  ( x  e.  A  ->  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z ) )
8 nfv 1577 . . . . . . . 8  |-  F/ z
ph
98mo3 2134 . . . . . . 7  |-  ( E* y ph  <->  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z ) )
107, 9sylibr 134 . . . . . 6  |-  ( x  e.  A  ->  E* y ph )
11 moanimv 2155 . . . . . 6  |-  ( E* y ( x  e.  A  /\  ph )  <->  ( x  e.  A  ->  E* y ph ) )
1210, 11mpbir 146 . . . . 5  |-  E* y
( x  e.  A  /\  ph )
135, 12mpgbir 1502 . . . 4  |-  Fun  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
14 isarep2.1 . . . . 5  |-  A  e. 
_V
1514funimaex 5422 . . . 4  |-  ( Fun 
{ <. x ,  y
>.  |  ( x  e.  A  /\  ph ) }  ->  ( { <. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A
)  e.  _V )
1613, 15ax-mp 5 . . 3  |-  ( {
<. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A )  e. 
_V
174, 16eqeltri 2304 . 2  |-  ( {
<. x ,  y >.  |  ph } " A
)  e.  _V
1817isseti 2812 1  |-  E. w  w  =  ( { <. x ,  y >.  |  ph } " A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1396    = wceq 1398   E.wex 1541   [wsb 1810   E*wmo 2080    e. wcel 2202   A.wral 2511   _Vcvv 2803   {copab 4154    |` cres 4733   "cima 4734   Fun wfun 5327
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-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-fun 5335
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator