Metamath Proof Explorer


Theorem prproropf1olem0

Description: Lemma 0 for prproropf1o . Remark: O , the set of ordered ordered pairs, i.e., ordered pairs in which the first component is less than the second component, can alternatively be written as O = { x e. ( V X. V ) | ( 1stx ) R ( 2ndx ) } or even as O = { x e. ( V X. V ) | <. ( 1stx ) , ( 2ndx ) >. e. R } , by which the relationship between ordered and unordered pair is immediately visible. (Contributed by AV, 18-Mar-2023)

Ref Expression
Hypothesis prproropf1o.o O=RV×V
Assertion prproropf1olem0 WOW=1stW2ndW1stWV2ndWV1stWR2ndW

Proof

Step Hyp Ref Expression
1 prproropf1o.o O=RV×V
2 1 eleq2i WOWRV×V
3 elin WRV×VWRWV×V
4 ancom WRW=1stW2ndW1stWV2ndWVW=1stW2ndW1stWV2ndWVWR
5 eleq1 W=1stW2ndWWR1stW2ndWR
6 df-br 1stWR2ndW1stW2ndWR
7 5 6 bitr4di W=1stW2ndWWR1stWR2ndW
8 7 adantr W=1stW2ndW1stWV2ndWVWR1stWR2ndW
9 8 pm5.32i W=1stW2ndW1stWV2ndWVWRW=1stW2ndW1stWV2ndWV1stWR2ndW
10 4 9 bitri WRW=1stW2ndW1stWV2ndWVW=1stW2ndW1stWV2ndWV1stWR2ndW
11 elxp6 WV×VW=1stW2ndW1stWV2ndWV
12 11 anbi2i WRWV×VWRW=1stW2ndW1stWV2ndWV
13 df-3an W=1stW2ndW1stWV2ndWV1stWR2ndWW=1stW2ndW1stWV2ndWV1stWR2ndW
14 10 12 13 3bitr4i WRWV×VW=1stW2ndW1stWV2ndWV1stWR2ndW
15 2 3 14 3bitri WOW=1stW2ndW1stWV2ndWV1stWR2ndW