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

Theorem freq2 4486
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 4485 . . 3  |-  ( A  =  B  ->  (FrFor  R A s  <-> FrFor  R B s ) )
21albidv 1877 . 2  |-  ( A  =  B  ->  ( A. sFrFor  R A s  <->  A. sFrFor  R B s ) )
3 df-frind 4472 . 2  |-  ( R  Fr  A  <->  A. sFrFor  R A s )
4 df-frind 4472 . 2  |-  ( R  Fr  B  <->  A. sFrFor  R B s )
52, 3, 43bitr4g 223 1  |-  ( A  =  B  ->  ( R  Fr  A  <->  R  Fr  B ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1400    = wceq 1402  FrFor wfrfor 4467    Fr wfr 4468
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This theorem depends on definitions:  df-bi 117  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-in 3226  df-ss 3233  df-frfor 4471  df-frind 4472
This theorem is referenced by:  weeq2  4497
  Copyright terms: Public domain W3C validator