Metamath Proof Explorer


Theorem wfr1OLD

Description: Obsolete proof of wfr1 as of 18-Nov-2024. (New usage is discouraged.) (Proof modification is discouraged.) (Contributed by Scott Fenton, 22-Apr-2011) (Revised by Mario Carneiro, 26-Jun-2015)

Ref Expression
Hypotheses wfr1OLD.1
|- R We A
wfr1OLD.2
|- R Se A
wfr1OLD.3
|- F = wrecs ( R , A , G )
Assertion wfr1OLD
|- F Fn A

Proof

Step Hyp Ref Expression
1 wfr1OLD.1
 |-  R We A
2 wfr1OLD.2
 |-  R Se A
3 wfr1OLD.3
 |-  F = wrecs ( R , A , G )
4 1 2 3 wfrfunOLD
 |-  Fun F
5 eqid
 |-  ( F u. { <. z , ( G ` ( F |` Pred ( R , A , z ) ) ) >. } ) = ( F u. { <. z , ( G ` ( F |` Pred ( R , A , z ) ) ) >. } )
6 1 2 3 5 wfrlem16OLD
 |-  dom F = A
7 df-fn
 |-  ( F Fn A <-> ( Fun F /\ dom F = A ) )
8 4 6 7 mpbir2an
 |-  F Fn A