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 = R V × V
Assertion prproropf1olem0 W O W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W

Proof

Step Hyp Ref Expression
1 prproropf1o.o O = R V × V
2 1 eleq2i W O W R V × V
3 elin W R V × V W R W V × V
4 ancom W R W = 1 st W 2 nd W 1 st W V 2 nd W V W = 1 st W 2 nd W 1 st W V 2 nd W V W R
5 eleq1 W = 1 st W 2 nd W W R 1 st W 2 nd W R
6 df-br 1 st W R 2 nd W 1 st W 2 nd W R
7 5 6 bitr4di W = 1 st W 2 nd W W R 1 st W R 2 nd W
8 7 adantr W = 1 st W 2 nd W 1 st W V 2 nd W V W R 1 st W R 2 nd W
9 8 pm5.32i W = 1 st W 2 nd W 1 st W V 2 nd W V W R W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W
10 4 9 bitri W R W = 1 st W 2 nd W 1 st W V 2 nd W V W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W
11 elxp6 W V × V W = 1 st W 2 nd W 1 st W V 2 nd W V
12 11 anbi2i W R W V × V W R W = 1 st W 2 nd W 1 st W V 2 nd W V
13 df-3an W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W
14 10 12 13 3bitr4i W R W V × V W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W
15 2 3 14 3bitri W O W = 1 st W 2 nd W 1 st W V 2 nd W V 1 st W R 2 nd W