HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem freq1 2922
Description: Equality theorem for the founded predicate.
Assertion
Ref Expression
freq1 |- (R = S -> (R Fr A <-> S Fr A))

Proof of Theorem freq1
StepHypRef Expression
1 breq 2621 . . . . . 6 |- (R = S -> (zRy <-> zSy))
21negbid 611 . . . . 5 |- (R = S -> (-. zRy <-> -. zSy))
32rexralbidv 1682 . . . 4 |- (R = S -> (E.y e. x A.z e. x -. zRy <-> E.y e. x A.z e. x -. zSy))
43imbi2d 612 . . 3 |- (R = S -> (((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zRy) <-> ((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zSy)))
54albidv 1278 . 2 |- (R = S -> (A.x((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zRy) <-> A.x((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zSy)))
6 df-fr 2917 . 2 |- (R Fr A <-> A.x((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zRy))
7 df-fr 2917 . 2 |- (S Fr A <-> A.x((x (_ A /\ x =/= (/)) -> E.y e. x A.z e. x -. zSy))
85, 6, 73bitr4g 555 1 |- (R = S -> (R Fr A <-> S Fr A))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954   = wceq 956   =/= wne 1585  A.wral 1645  E.wrex 1646   (_ wss 2047  (/)c0 2280   class class class wbr 2619   Fr wfr 2915
This theorem is referenced by:  weeq1 2937
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-17 971  ax-4 973  ax-5o 975  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-cleq 1469  df-clel 1472  df-ral 1649  df-rex 1650  df-br 2620  df-fr 2917
Copyright terms: Public domain