Metamath Proof Explorer


Theorem dffo3f

Description: An onto mapping expressed in terms of function values. As dffo3 but with less disjoint vars constraints. (Contributed by Glauco Siliprandi, 17-Aug-2020)

Ref Expression
Hypothesis dffo3f.1 _xF
Assertion dffo3f F:AontoBF:AByBxAy=Fx

Proof

Step Hyp Ref Expression
1 dffo3f.1 _xF
2 dffo2 F:AontoBF:ABranF=B
3 ffn F:ABFFnA
4 fnrnfv FFnAranF=y|wAy=Fw
5 nfcv _xw
6 1 5 nffv _xFw
7 6 nfeq2 xy=Fw
8 nfv wy=Fx
9 fveq2 w=xFw=Fx
10 9 eqeq2d w=xy=Fwy=Fx
11 7 8 10 cbvrexw wAy=FwxAy=Fx
12 11 abbii y|wAy=Fw=y|xAy=Fx
13 4 12 eqtrdi FFnAranF=y|xAy=Fx
14 13 eqeq1d FFnAranF=By|xAy=Fx=B
15 3 14 syl F:ABranF=By|xAy=Fx=B
16 dfbi2 xAy=FxyBxAy=FxyByBxAy=Fx
17 nfcv _xA
18 nfcv _xB
19 1 17 18 nff xF:AB
20 nfv xyB
21 simpr F:ABxAy=Fxy=Fx
22 ffvelrn F:ABxAFxB
23 22 adantr F:ABxAy=FxFxB
24 21 23 eqeltrd F:ABxAy=FxyB
25 19 20 24 rexlimd3 F:ABxAy=FxyB
26 25 biantrurd F:AByBxAy=FxxAy=FxyByBxAy=Fx
27 16 26 bitr4id F:ABxAy=FxyByBxAy=Fx
28 27 albidv F:AByxAy=FxyByyBxAy=Fx
29 abeq1 y|xAy=Fx=ByxAy=FxyB
30 df-ral yBxAy=FxyyBxAy=Fx
31 28 29 30 3bitr4g F:ABy|xAy=Fx=ByBxAy=Fx
32 15 31 bitrd F:ABranF=ByBxAy=Fx
33 32 pm5.32i F:ABranF=BF:AByBxAy=Fx
34 2 33 bitri F:AontoBF:AByBxAy=Fx