Metamath Proof Explorer


Theorem onfrALTlem5

Description: Lemma for onfrALT . (Contributed by Alan Sare, 22-Jul-2012) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion onfrALTlem5 [˙ax/b]˙baxbybby=axaxaxyaxaxy=

Proof

Step Hyp Ref Expression
1 vex aV
2 1 inex1 axV
3 sbcimg axV[˙ax/b]˙baxbybby=[˙ax/b]˙baxb[˙ax/b]˙ybby=
4 2 3 ax-mp [˙ax/b]˙baxbybby=[˙ax/b]˙baxb[˙ax/b]˙ybby=
5 sbcan [˙ax/b]˙baxb[˙ax/b]˙bax[˙ax/b]˙b
6 sseq1 b=axbaxaxax
7 2 6 sbcie [˙ax/b]˙baxaxax
8 df-ne b¬b=
9 8 sbcbii [˙ax/b]˙b[˙ax/b]˙¬b=
10 sbcng axV[˙ax/b]˙¬b=¬[˙ax/b]˙b=
11 10 bicomd axV¬[˙ax/b]˙b=[˙ax/b]˙¬b=
12 2 11 ax-mp ¬[˙ax/b]˙b=[˙ax/b]˙¬b=
13 eqsbc1 axV[˙ax/b]˙b=ax=
14 2 13 ax-mp [˙ax/b]˙b=ax=
15 14 necon3bbii ¬[˙ax/b]˙b=ax
16 9 12 15 3bitr2i [˙ax/b]˙bax
17 7 16 anbi12i [˙ax/b]˙bax[˙ax/b]˙baxaxax
18 5 17 bitri [˙ax/b]˙baxbaxaxax
19 df-rex ybby=yybby=
20 19 sbcbii [˙ax/b]˙ybby=[˙ax/b]˙yybby=
21 sbcan [˙ax/b]˙ybby=[˙ax/b]˙yb[˙ax/b]˙by=
22 sbcel2gv axV[˙ax/b]˙ybyax
23 2 22 ax-mp [˙ax/b]˙ybyax
24 sbceqg axV[˙ax/b]˙by=ax/bby=ax/b
25 2 24 ax-mp [˙ax/b]˙by=ax/bby=ax/b
26 csbin ax/bby=ax/bbax/by
27 csbvarg axVax/bb=ax
28 2 27 ax-mp ax/bb=ax
29 csbconstg axVax/by=y
30 2 29 ax-mp ax/by=y
31 28 30 ineq12i ax/bbax/by=axy
32 26 31 eqtri ax/bby=axy
33 csb0 ax/b=
34 32 33 eqeq12i ax/bby=ax/baxy=
35 25 34 bitri [˙ax/b]˙by=axy=
36 23 35 anbi12i [˙ax/b]˙yb[˙ax/b]˙by=yaxaxy=
37 21 36 bitri [˙ax/b]˙ybby=yaxaxy=
38 37 exbii y[˙ax/b]˙ybby=yyaxaxy=
39 sbcex2 [˙ax/b]˙yybby=y[˙ax/b]˙ybby=
40 df-rex yaxaxy=yyaxaxy=
41 38 39 40 3bitr4i [˙ax/b]˙yybby=yaxaxy=
42 20 41 bitri [˙ax/b]˙ybby=yaxaxy=
43 18 42 imbi12i [˙ax/b]˙baxb[˙ax/b]˙ybby=axaxaxyaxaxy=
44 4 43 bitri [˙ax/b]˙baxbybby=axaxaxyaxaxy=