Description: Show that an unordered pair is a valid edge in a pseudograph. (Contributed by Mario Carneiro, 12-Mar-2015) (Revised by Mario Carneiro, 28-Feb-2016) (Revised by AV, 28-Feb-2021)
Ref | Expression | ||
---|---|---|---|
Hypotheses | upgrbi.x | |
|
upgrbi.y | |
||
Assertion | upgrbi | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | upgrbi.x | |
|
2 | upgrbi.y | |
|
3 | prssi | |
|
4 | 1 2 3 | mp2an | |
5 | prex | |
|
6 | 5 | elpw | |
7 | 4 6 | mpbir | |
8 | 1 | elexi | |
9 | 8 | prnz | |
10 | eldifsn | |
|
11 | 7 9 10 | mpbir2an | |
12 | hashprlei | |
|
13 | 12 | simpri | |
14 | fveq2 | |
|
15 | 14 | breq1d | |
16 | 15 | elrab | |
17 | 11 13 16 | mpbir2an | |