Description: At least two sets exist (or in terms of first-order logic, the universe of discourse has two or more objects). Note that we may not substitute the same variable for both x and y (as indicated by the distinct variable requirement), for otherwise we would contradict stdpc6 .
This theorem is proved directly from set theory axioms (no set theory definitions) and does not use ax-ext or ax-sep . See dtruALT for a shorter proof using these axioms.
The proof makes use of dummy variables z and w which do not appear in the final theorem. They must be distinct from each other and from x and y . In other words, if we were to substitute x for z throughout the proof, the proof would fail. (Contributed by NM, 7-Nov-2006) Avoid ax-13 . (Revised by Gino Giotto, 5-Sep-2023) Avoid ax-12 . (Revised by Rohan Ridenour, 9-Oct-2024)
Ref | Expression | ||
---|---|---|---|
Assertion | dtru |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | el | ||
2 | ax-nul | ||
3 | elequ1 | ||
4 | 3 | notbid | |
5 | 4 | spw | |
6 | 2 5 | eximii | |
7 | exdistrv | ||
8 | 1 6 7 | mpbir2an | |
9 | ax9v2 | ||
10 | 9 | com12 | |
11 | 10 | con3dimp | |
12 | 11 | 2eximi | |
13 | equequ2 | ||
14 | 13 | notbid | |
15 | ax7v1 | ||
16 | 15 | con3d | |
17 | 16 | spimevw | |
18 | 14 17 | syl6bi | |
19 | ax7v1 | ||
20 | 19 | con3d | |
21 | 20 | spimevw | |
22 | 21 | a1d | |
23 | 18 22 | pm2.61i | |
24 | 23 | exlimivv | |
25 | 8 12 24 | mp2b | |
26 | exnal | ||
27 | 25 26 | mpbi |