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

Theorem isarep2 5205
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 5203. (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 4847 . . . 4  |-  ( ( { <. x ,  y
>.  |  ph }  |`  A )
" A )  =  ( { <. x ,  y >.  |  ph } " A )
2 resopab 4858 . . . . 5  |-  ( {
<. x ,  y >.  |  ph }  |`  A )  =  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
32imaeq1i 4873 . . . 4  |-  ( ( { <. x ,  y
>.  |  ph }  |`  A )
" A )  =  ( { <. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A
)
41, 3eqtr3i 2160 . . 3  |-  ( {
<. x ,  y >.  |  ph } " A
)  =  ( {
<. x ,  y >.  |  ( x  e.  A  /\  ph ) } " A )
5 funopab 5153 . . . . 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 2482 . . . . . . 7  |-  ( x  e.  A  ->  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z ) )
8 nfv 1508 . . . . . . . 8  |-  F/ z
ph
98mo3 2051 . . . . . . 7  |-  ( E* y ph  <->  A. y A. z ( ( ph  /\ 
[ z  /  y ] ph )  ->  y  =  z ) )
107, 9sylibr 133 . . . . . 6  |-  ( x  e.  A  ->  E* y ph )
11 moanimv 2072 . . . . . 6  |-  ( E* y ( x  e.  A  /\  ph )  <->  ( x  e.  A  ->  E* y ph ) )
1210, 11mpbir 145 . . . . 5  |-  E* y
( x  e.  A  /\  ph )
135, 12mpgbir 1429 . . . 4  |-  Fun  { <. x ,  y >.  |  ( x  e.  A  /\  ph ) }
14 isarep2.1 . . . . 5  |-  A  e. 
_V
1514funimaex 5203 . . . 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 2210 . 2  |-  ( {
<. x ,  y >.  |  ph } " A
)  e.  _V
1817isseti 2689 1  |-  E. w  w  =  ( { <. x ,  y >.  |  ph } " A
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   A.wal 1329    = wceq 1331   E.wex 1468    e. wcel 1480   [wsb 1735   E*wmo 1998   A.wral 2414   _Vcvv 2681   {copab 3983    |` cres 4536   "cima 4537   Fun wfun 5112
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-pow 4093  ax-pr 4126
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-rex 2420  df-v 2683  df-un 3070  df-in 3072  df-ss 3079  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-opab 3985  df-id 4210  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-fun 5120
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator