Theorem frforeq1 4260

Description: Equality theorem for the well-founded predicate. (Contributed by Jim Kingdon, 22-Sep-2021.)

Assertion

Ref	Expression
frforeq1	|- ( R = S -> (FrFor R A T <-> FrFor S A T ) )

Proof of Theorem frforeq1

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq 3926	. . . . . . 7 |- ( R = S -> ( y R x <-> y S x ) )
2	1	imbi1d 230	. . . . . 6 |- ( R = S -> ( ( y R x -> y e. T ) <-> ( y S x -> y e. T ) ) )
3	2	ralbidv 2435	. . . . 5 |- ( R = S -> ( A. y e. A ( y R x -> y e. T ) <-> A. y e. A ( y S x -> y e. T ) ) )
4	3	imbi1d 230	. . . 4 |- ( R = S -> ( ( A. y e. A ( y R x -> y e. T ) -> x e. T ) <-> ( A. y e. A ( y S x -> y e. T ) -> x e. T ) ) )
5	4	ralbidv 2435	. . 3 |- ( R = S -> ( A. x e. A ( A. y e. A ( y R x -> y e. T ) -> x e. T ) <-> A. x e. A ( A. y e. A ( y S x -> y e. T ) -> x e. T ) ) )
6	5	imbi1d 230	. 2 |- ( R = S -> ( ( A. x e. A ( A. y e. A ( y R x -> y e. T ) -> x e. T ) -> A C_ T ) <-> ( A. x e. A ( A. y e. A ( y S x -> y e. T ) -> x e. T ) -> A C_ T ) ) )
7		df-frfor 4248	. 2 |- (FrFor R A T <-> ( A. x e. A ( A. y e. A ( y R x -> y e. T ) -> x e. T ) -> A C_ T ) )
8		df-frfor 4248	. 2 |- (FrFor S A T <-> ( A. x e. A ( A. y e. A ( y S x -> y e. T ) -> x e. T ) -> A C_ T ) )
9	6, 7, 8	3bitr4g 222	1 |- ( R = S -> (FrFor R A T <-> FrFor S A T ) )

Syntax hints:   -> wi 4   <-> wb 104   = wceq 1331   e. wcel 1480   A.wral 2414   C_ wss 3066   class class class wbr 3924  FrFor wfrfor 4244

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1423  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-4 1487  ax-17 1506  ax-ial 1514  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-nf 1437  df-cleq 2130  df-clel 2133  df-ral 2419  df-br 3925  df-frfor 4248

This theorem is referenced by:  freq1  4261