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

Theorem reusv1 4190
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 2355 . . . 4  |-  F/ y A. y  e.  B  ( ph  ->  x  =  C )
21nfmo 1920 . . 3  |-  F/ y E* x A. y  e.  B  ( ph  ->  x  =  C )
3 rsp 2369 . . . . . . . 8  |-  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  ( y  e.  B  ->  ( ph  ->  x  =  C ) ) )
43impd 242 . . . . . . 7  |-  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  ( (
y  e.  B  /\  ph )  ->  x  =  C ) )
54com12 27 . . . . . 6  |-  ( ( y  e.  B  /\  ph )  ->  ( A. y  e.  B  ( ph  ->  x  =  C )  ->  x  =  C ) )
65alrimiv 1754 . . . . 5  |-  ( ( y  e.  B  /\  ph )  ->  A. x
( A. y  e.  B  ( ph  ->  x  =  C )  ->  x  =  C )
)
7 moeq 2716 . . . . 5  |-  E* x  x  =  C
8 moim 1964 . . . . 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 1335 . . . 4  |-  ( ( y  e.  B  /\  ph )  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) )
109ex 108 . . 3  |-  ( y  e.  B  ->  ( ph  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) ) )
112, 10rexlimi 2426 . 2  |-  ( E. y  e.  B  ph  ->  E* x A. y  e.  B  ( ph  ->  x  =  C ) )
12 mormo 2521 . 2  |-  ( E* x A. y  e.  B  ( ph  ->  x  =  C )  ->  E* x  e.  A  A. y  e.  B  ( ph  ->  x  =  C ) )
13 reu5 2522 . . 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 830 . 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 97    <-> wb 98   A.wal 1241    = wceq 1243    e. wcel 1393   E*wmo 1901   A.wral 2306   E.wrex 2307   E!wreu 2308   E*wrmo 2309
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022
This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-ral 2311  df-rex 2312  df-reu 2313  df-rmo 2314  df-v 2559
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator