Metamath Proof Explorer


Definition df-ltp

Description: Define ordering on positive reals. This is a "temporary" set used in the construction of complex numbers df-c , and is intended to be used only by the construction. From Proposition 9-3.2 of Gleason p. 122. (Contributed by NM, 14-Feb-1996) (New usage is discouraged.)

Ref Expression
Assertion df-ltp ⊢ < 𝑷 = x y | x ∈ 𝑷 ∧ y ∈ 𝑷 ∧ x ⊂ y

Detailed syntax breakdown

Step Hyp Ref Expression
0 cltp class < 𝑷
1 vx setvar x
2 vy setvar y
3 1 cv setvar x
4 cnp class 𝑷
5 3 4 wcel wff x ∈ 𝑷
6 2 cv setvar y
7 6 4 wcel wff y ∈ 𝑷
8 5 7 wa wff x ∈ 𝑷 ∧ y ∈ 𝑷
9 3 6 wpss wff x ⊂ y
10 8 9 wa wff x ∈ 𝑷 ∧ y ∈ 𝑷 ∧ x ⊂ y
11 10 1 2 copab class x y | x ∈ 𝑷 ∧ y ∈ 𝑷 ∧ x ⊂ y
12 0 11 wceq wff < 𝑷 = x y | x ∈ 𝑷 ∧ y ∈ 𝑷 ∧ x ⊂ y