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

Theorem freq2 4101
Description: Equality theorem for the well-founded predicate. (Contributed by NM, 3-Apr-1994.)
Assertion
Ref Expression
freq2  |-  ( A  =  B  ->  ( R  Fr  A  <->  R  Fr  B ) )

Proof of Theorem freq2
Dummy variable  s is distinct from all other variables.
StepHypRef Expression
1 frforeq2 4100 . . 3  |-  ( A  =  B  ->  (FrFor  R A s  <-> FrFor  R B s ) )
21albidv 1745 . 2  |-  ( A  =  B  ->  ( A. sFrFor  R A s  <->  A. sFrFor  R B s ) )
3 df-frind 4087 . 2  |-  ( R  Fr  A  <->  A. sFrFor  R A s )
4 df-frind 4087 . 2  |-  ( R  Fr  B  <->  A. sFrFor  R B s )
52, 3, 43bitr4g 221 1  |-  ( A  =  B  ->  ( R  Fr  A  <->  R  Fr  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 103   A.wal 1282    = wceq 1284  FrFor wfrfor 4082    Fr wfr 4083
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-in 2979  df-ss 2986  df-frfor 4086  df-frind 4087
This theorem is referenced by:  weeq2  4112
  Copyright terms: Public domain W3C validator