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

Theorem reusv1 4505
Description: Two ways to express single-valuedness of a class expression  C ( y ). (Contributed by NM, 16-Dec-2012.) (Proof shortened by Mario Carneiro, 18-Nov-2016.)
Assertion
Ref Expression
reusv1  |-  ( E. y  e.  B  ph  ->  ( E! x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  <->  E. x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) ) )
Distinct variable groups:    x, A    x, B    x, C    ph, x    x, y
Allowed substitution hints:    ph( y)    A( y)    B( y)    C( y)

Proof of Theorem reusv1
StepHypRef Expression
1 nfra1 2537 . . . 4  |-  F/ y A. y  e.  B  ( ph  ->  x  =  C )
21nfmo 2074 . . 3  |-  F/ y E* x A. y  e.  B  ( ph  ->  x  =  C )
3 rsp 2553 . . . . . . . 8  |-  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  ( y  e.  B  ->  ( ph  ->  x  =  C ) ) )
43impd 254 . . . . . . 7  |-  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  ( (
y  e.  B  /\  ph )  ->  x  =  C ) )
54com12 30 . . . . . 6  |-  ( ( y  e.  B  /\  ph )  ->  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  x  =  C ) )
65alrimiv 1897 . . . . 5  |-  ( ( y  e.  B  /\  ph )  ->  A. x
( A. y  e.  B  ( ph  ->  x  =  C )  ->  x  =  C )
)
7 moeq 2948 . . . . 5  |-  E* x  x  =  C
8 moim 2118 . . . . 5  |-  ( A. x ( A. y  e.  B  ( ph  ->  x  =  C )  ->  x  =  C )  ->  ( E* x  x  =  C  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) ) )
96, 7, 8mpisyl 1466 . . . 4  |-  ( ( y  e.  B  /\  ph )  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) )
109ex 115 . . 3  |-  ( y  e.  B  ->  ( ph  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) ) )
112, 10rexlimi 2616 . 2  |-  ( E. y  e.  B  ph  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) )
12 mormo 2722 . 2  |-  ( E* x A. y  e.  B  ( ph  ->  x  =  C )  ->  E* x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) )
13 reu5 2723 . . 3  |-  ( E! x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  <->  ( E. x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  /\  E* x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) ) )
1413rbaib 923 . 2  |-  ( E* x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  ->  ( E! x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  <->  E. x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) ) )
1511, 12, 143syl 17 1  |-  ( E. y  e.  B  ph  ->  ( E! x  e.  A  A. y  e.  B  ( ph  ->  x  =  C )  <->  E. x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1371    = wceq 1373   E*wmo 2055    e. wcel 2176   A.wral 2484   E.wrex 2485   E!wreu 2486   E*wrmo 2487
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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-v 2774
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator