Theorem frforeq2 4262

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

Assertion

Ref	Expression
frforeq2	|- ( A = B -> (FrFor R A T <-> FrFor R B T ) )

Proof of Theorem frforeq2

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

Step	Hyp	Ref	Expression
1		raleq 2624	. . . . 5 |- ( A = B -> ( A. y e. A ( y R x -> y e. T ) <-> A. y e. B ( y R x -> y e. T ) ) )
2	1	imbi1d 230	. . . 4 |- ( A = B -> ( ( A. y e. A ( y R x -> y e. T ) -> x e. T ) <-> ( A. y e. B ( y R x -> y e. T ) -> x e. T ) ) )
3	2	raleqbi1dv 2632	. . 3 |- ( A = B -> ( A. x e. A ( A. y e. A ( y R x -> y e. T ) -> x e. T ) <-> A. x e. B ( A. y e. B ( y R x -> y e. T ) -> x e. T ) ) )
4		sseq1 3115	. . 3 |- ( A = B -> ( A C_ T <-> B C_ T ) )
5	3, 4	imbi12d 233	. 2 |- ( A = B -> ( ( A. x e. A ( A. y e. A ( y R x -> y e. T ) -> x e. T ) -> A C_ T ) <-> ( A. x e. B ( A. y e. B ( y R x -> y e. T ) -> x e. T ) -> B C_ T ) ) )
6		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 ) )
7		df-frfor 4248	. 2 |- (FrFor R B T <-> ( A. x e. B ( A. y e. B ( y R x -> y e. T ) -> x e. T ) -> B C_ T ) )
8	5, 6, 7	3bitr4g 222	1 |- ( A = B -> (FrFor R A T <-> FrFor R B 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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-in 3072  df-ss 3079  df-frfor 4248

This theorem is referenced by:  freq2  4263