Metamath Proof Explorer


Theorem weexenwe

Description: If a well-ordering of an infinite set exists, then a well-ordering equinumerous to the set exists. (Contributed by BTernaryTau, 31-Jul-2026)

Ref Expression
Assertion weexenwe ⊢ ∃ r r We A ∧ ω ≼ A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A

Proof

Step Hyp Ref Expression
1 ween ⊢ A ∈ dom ⁡ card ↔ ∃ r r We A
2 inss2 ⊢ r ∩ A × A ⊆ A × A
3 weinxp ⊢ r We A ↔ r ∩ A × A We A
4 3 biimpi ⊢ r We A → r ∩ A × A We A
5 4 3ad2ant3 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ r We A → r ∩ A × A We A
6 reldom ⊢ Rel ⁡ ≼
7 6 brrelex2i ⊢ ω ≼ A → A ∈ V
8 7 7 xpexd ⊢ ω ≼ A → A × A ∈ V
9 ssdomg ⊢ A × A ∈ V → r ∩ A × A ⊆ A × A → r ∩ A × A ≼ A × A
10 8 2 9 mpisyl ⊢ ω ≼ A → r ∩ A × A ≼ A × A
11 infxpidm2 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A → A × A ≈ A
12 domentr ⊢ r ∩ A × A ≼ A × A ∧ A × A ≈ A → r ∩ A × A ≼ A
13 10 11 12 syl2an2 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A → r ∩ A × A ≼ A
14 13 3adant3 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ r We A → r ∩ A × A ≼ A
15 weso ⊢ r ∩ A × A We A → r ∩ A × A Or A
16 3 15 sylbi ⊢ r We A → r ∩ A × A Or A
17 vex ⊢ r ∈ V
18 17 inex1 ⊢ r ∩ A × A ∈ V
19 soinfdom ⊢ r ∩ A × A Or A ∧ r ∩ A × A ∈ V ∧ ω ≼ A → A ≼ r ∩ A × A
20 18 19 mp3an2 ⊢ r ∩ A × A Or A ∧ ω ≼ A → A ≼ r ∩ A × A
21 16 20 sylan ⊢ r We A ∧ ω ≼ A → A ≼ r ∩ A × A
22 21 ancoms ⊢ ω ≼ A ∧ r We A → A ≼ r ∩ A × A
23 22 3adant1 ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ r We A → A ≼ r ∩ A × A
24 sbth ⊢ r ∩ A × A ≼ A ∧ A ≼ r ∩ A × A → r ∩ A × A ≈ A
25 14 23 24 syl2anc ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ r We A → r ∩ A × A ≈ A
26 sseq1 ⊢ s = r ∩ A × A → s ⊆ A × A ↔ r ∩ A × A ⊆ A × A
27 weeq1 ⊢ s = r ∩ A × A → s We A ↔ r ∩ A × A We A
28 breq1 ⊢ s = r ∩ A × A → s ≈ A ↔ r ∩ A × A ≈ A
29 26 27 28 3anbi123d ⊢ s = r ∩ A × A → s ⊆ A × A ∧ s We A ∧ s ≈ A ↔ r ∩ A × A ⊆ A × A ∧ r ∩ A × A We A ∧ r ∩ A × A ≈ A
30 18 29 spcev ⊢ r ∩ A × A ⊆ A × A ∧ r ∩ A × A We A ∧ r ∩ A × A ≈ A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
31 2 5 25 30 mp3an2i ⊢ A ∈ dom ⁡ card ∧ ω ≼ A ∧ r We A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
32 31 3expia ⊢ A ∈ dom ⁡ card ∧ ω ≼ A → r We A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
33 32 exlimdv ⊢ A ∈ dom ⁡ card ∧ ω ≼ A → ∃ r r We A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
34 1 33 sylanbr ⊢ ∃ r r We A ∧ ω ≼ A → ∃ r r We A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
35 34 adantrd ⊢ ∃ r r We A ∧ ω ≼ A → ∃ r r We A ∧ ω ≼ A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A
36 35 pm2.43i ⊢ ∃ r r We A ∧ ω ≼ A → ∃ s s ⊆ A × A ∧ s We A ∧ s ≈ A