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

Theorem rmoeq1f 2689
Description: Equality theorem for restricted at-most-one quantifier, with bound-variable hypotheses instead of distinct variable restrictions. (Contributed by Alexander van der Vekens, 17-Jun-2017.)
Hypotheses
Ref Expression
raleq1f.1  |-  F/_ x A
raleq1f.2  |-  F/_ x B
Assertion
Ref Expression
rmoeq1f  |-  ( A  =  B  ->  ( E* x  e.  A  ph  <->  E* x  e.  B  ph ) )

Proof of Theorem rmoeq1f
StepHypRef Expression
1 raleq1f.1 . . . 4  |-  F/_ x A
2 raleq1f.2 . . . 4  |-  F/_ x B
31, 2nfeq 2344 . . 3  |-  F/ x  A  =  B
4 eleq2 2257 . . . 4  |-  ( A  =  B  ->  (
x  e.  A  <->  x  e.  B ) )
54anbi1d 465 . . 3  |-  ( A  =  B  ->  (
( x  e.  A  /\  ph )  <->  ( x  e.  B  /\  ph )
) )
63, 5mobid 2077 . 2  |-  ( A  =  B  ->  ( E* x ( x  e.  A  /\  ph )  <->  E* x ( x  e.  B  /\  ph )
) )
7 df-rmo 2480 . 2  |-  ( E* x  e.  A  ph  <->  E* x ( x  e.  A  /\  ph )
)
8 df-rmo 2480 . 2  |-  ( E* x  e.  B  ph  <->  E* x ( x  e.  B  /\  ph )
)
96, 7, 83bitr4g 223 1  |-  ( A  =  B  ->  ( E* x  e.  A  ph  <->  E* x  e.  B  ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364   E*wmo 2043    e. wcel 2164   F/_wnfc 2323   E*wrmo 2475
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-cleq 2186  df-clel 2189  df-nfc 2325  df-rmo 2480
This theorem is referenced by:  rmoeq1  2693
  Copyright terms: Public domain W3C validator