Metamath Proof Explorer


Theorem werankwe

Description: Construct a well-order given a relation R ( x ) that well-orders elements of the same rank. (Contributed by BTernaryTau, 16-Sep-2026)

Ref Expression
Hypotheses werankwe.1 ⊢ S = x y | rank ⁡ x ∈ rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y
werankwe.2 ⊢ w = rank ⁡ x → T = R
werankwe.3 ⊢ v = x → U = R
Assertion werankwe ⊢ ∀ x ∈ A R We z ∈ A | rank ⁡ z = rank ⁡ x → S We A

Proof

Step Hyp Ref Expression
1 werankwe.1 ⊢ S = x y | rank ⁡ x ∈ rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y
2 werankwe.2 ⊢ w = rank ⁡ x → T = R
3 werankwe.3 ⊢ v = x → U = R
4 fveq2 ⊢ v = x → rank ⁡ v = rank ⁡ x
5 4 eqeq2d ⊢ v = x → rank ⁡ z = rank ⁡ v ↔ rank ⁡ z = rank ⁡ x
6 5 rabbidv ⊢ v = x → z ∈ A | rank ⁡ z = rank ⁡ v = z ∈ A | rank ⁡ z = rank ⁡ x
7 3 6 weeq12d ⊢ v = x → U We z ∈ A | rank ⁡ z = rank ⁡ v ↔ R We z ∈ A | rank ⁡ z = rank ⁡ x
8 7 cbvralvw ⊢ ∀ v ∈ A U We z ∈ A | rank ⁡ z = rank ⁡ v ↔ ∀ x ∈ A R We z ∈ A | rank ⁡ z = rank ⁡ x
9 fvex ⊢ rank ⁡ y ∈ V
10 9 epeli ⊢ rank ⁡ x E rank ⁡ y ↔ rank ⁡ x ∈ rank ⁡ y
11 10 orbi1i ⊢ rank ⁡ x E rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y ↔ rank ⁡ x ∈ rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y
12 11 opabbii ⊢ x y | rank ⁡ x E rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y = x y | rank ⁡ x ∈ rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y
13 1 12 eqtr4i ⊢ S = x y | rank ⁡ x E rank ⁡ y ∨ rank ⁡ x = rank ⁡ y ∧ x R y
14 fveqeq2 ⊢ z = y → rank ⁡ z = rank ⁡ x ↔ rank ⁡ y = rank ⁡ x
15 14 cbvrabv ⊢ z ∈ A | rank ⁡ z = rank ⁡ x = y ∈ A | rank ⁡ y = rank ⁡ x
16 6 15 eqtrdi ⊢ v = x → z ∈ A | rank ⁡ z = rank ⁡ v = y ∈ A | rank ⁡ y = rank ⁡ x
17 3 16 weeq12d ⊢ v = x → U We z ∈ A | rank ⁡ z = rank ⁡ v ↔ R We y ∈ A | rank ⁡ y = rank ⁡ x
18 17 rspccva ⊢ ∀ v ∈ A U We z ∈ A | rank ⁡ z = rank ⁡ v ∧ x ∈ A → R We y ∈ A | rank ⁡ y = rank ⁡ x
19 rankfo ⊢ rank : V ⟶ onto On
20 fof ⊢ rank : V ⟶ onto On → rank : V ⟶ On
21 19 20 ax-mp ⊢ rank : V ⟶ On
22 ssv ⊢ A ⊆ V
23 fssres ⊢ rank : V ⟶ On ∧ A ⊆ V → rank ↾ A : A ⟶ On
24 21 22 23 mp2an ⊢ rank ↾ A : A ⟶ On
25 24 a1i ⊢ ∀ v ∈ A U We z ∈ A | rank ⁡ z = rank ⁡ v → rank ↾ A : A ⟶ On
26 epweon ⊢ E We On
27 26 a1i ⊢ ∀ v ∈ A U We z ∈ A | rank ⁡ z = rank ⁡ v → E We On
28 2 13 18 25 27 fnwe2 ⊢ ∀ v ∈ A U We z ∈ A | rank ⁡ z = rank ⁡ v → S We A
29 8 28 sylbir ⊢ ∀ x ∈ A R We z ∈ A | rank ⁡ z = rank ⁡ x → S We A