Metamath Proof Explorer


Theorem 1sdom

Description: A set that strictly dominates ordinal 1 has at least 2 different members. (Closely related to 2dom .) (Contributed by Mario Carneiro, 12-Jan-2013)

Ref Expression
Assertion 1sdom AV1𝑜AxAyA¬x=y

Proof

Step Hyp Ref Expression
1 breq2 a=A1𝑜a1𝑜A
2 rexeq a=Aya¬x=yyA¬x=y
3 2 rexeqbi1dv a=Axaya¬x=yxAyA¬x=y
4 1onn 1𝑜ω
5 sucdom 1𝑜ω1𝑜asuc1𝑜a
6 4 5 ax-mp 1𝑜asuc1𝑜a
7 df-2o 2𝑜=suc1𝑜
8 7 breq1i 2𝑜asuc1𝑜a
9 2dom 2𝑜axaya¬x=y
10 df2o3 2𝑜=1𝑜
11 vex xV
12 vex yV
13 0ex V
14 1oex 1𝑜V
15 11 12 13 14 funpr xyFunxy1𝑜
16 df-ne xy¬x=y
17 1n0 1𝑜
18 17 necomi 1𝑜
19 13 14 11 12 fpr 1𝑜x1𝑜y:1𝑜xy
20 18 19 ax-mp x1𝑜y:1𝑜xy
21 df-f1 x1𝑜y:1𝑜1-1xyx1𝑜y:1𝑜xyFunx1𝑜y-1
22 20 21 mpbiran x1𝑜y:1𝑜1-1xyFunx1𝑜y-1
23 13 11 cnvsn x-1=x
24 14 12 cnvsn 1𝑜y-1=y1𝑜
25 23 24 uneq12i x-11𝑜y-1=xy1𝑜
26 df-pr x1𝑜y=x1𝑜y
27 26 cnveqi x1𝑜y-1=x1𝑜y-1
28 cnvun x1𝑜y-1=x-11𝑜y-1
29 27 28 eqtri x1𝑜y-1=x-11𝑜y-1
30 df-pr xy1𝑜=xy1𝑜
31 25 29 30 3eqtr4i x1𝑜y-1=xy1𝑜
32 31 funeqi Funx1𝑜y-1Funxy1𝑜
33 22 32 bitr2i Funxy1𝑜x1𝑜y:1𝑜1-1xy
34 15 16 33 3imtr3i ¬x=yx1𝑜y:1𝑜1-1xy
35 prssi xayaxya
36 f1ss x1𝑜y:1𝑜1-1xyxyax1𝑜y:1𝑜1-1a
37 34 35 36 syl2an ¬x=yxayax1𝑜y:1𝑜1-1a
38 prex x1𝑜yV
39 f1eq1 f=x1𝑜yf:1𝑜1-1ax1𝑜y:1𝑜1-1a
40 38 39 spcev x1𝑜y:1𝑜1-1aff:1𝑜1-1a
41 37 40 syl ¬x=yxayaff:1𝑜1-1a
42 vex aV
43 42 brdom 1𝑜aff:1𝑜1-1a
44 41 43 sylibr ¬x=yxaya1𝑜a
45 44 expcom xaya¬x=y1𝑜a
46 45 rexlimivv xaya¬x=y1𝑜a
47 10 46 eqbrtrid xaya¬x=y2𝑜a
48 9 47 impbii 2𝑜axaya¬x=y
49 6 8 48 3bitr2i 1𝑜axaya¬x=y
50 1 3 49 vtoclbg AV1𝑜AxAyA¬x=y