| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > df-so | Structured version Visualization version GIF version | ||
| Description: Define the strict complete (linear) order predicate. The expression 𝑅 Or 𝐴 is true if relationship 𝑅 orders 𝐴. For example, < Or ℝ is true (ltso 11308). Equivalent to Definition 6.19(1) of [TakeutiZaring] p. 29. (Contributed by NM, 21-Jan-1996.) |
| Ref | Expression |
|---|---|
| df-so | ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cA | . . 3 class 𝐴 | |
| 2 | cR | . . 3 class 𝑅 | |
| 3 | 1, 2 | wor 5573 | . 2 wff 𝑅 Or 𝐴 |
| 4 | 1, 2 | wpo 5572 | . . 3 wff 𝑅 Po 𝐴 |
| 5 | vx | . . . . . . . 8 setvar 𝑥 | |
| 6 | 5 | cv 1569 | . . . . . . 7 class 𝑥 |
| 7 | vy | . . . . . . . 8 setvar 𝑦 | |
| 8 | 7 | cv 1569 | . . . . . . 7 class 𝑦 |
| 9 | 6, 8, 2 | wbr 5114 | . . . . . 6 wff 𝑥𝑅𝑦 |
| 10 | 5, 7 | weq 1995 | . . . . . 6 wff 𝑥 = 𝑦 |
| 11 | 8, 6, 2 | wbr 5114 | . . . . . 6 wff 𝑦𝑅𝑥 |
| 12 | 9, 10, 11 | w3o 1102 | . . . . 5 wff (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) |
| 13 | 12, 7, 1 | wral 3082 | . . . 4 wff ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) |
| 14 | 13, 5, 1 | wral 3082 | . . 3 wff ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥) |
| 15 | 4, 14 | wa 401 | . 2 wff (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥)) |
| 16 | 3, 15 | wb 209 | 1 wff (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ∨ 𝑥 = 𝑦 ∨ 𝑦𝑅𝑥))) |
| Colors of variables: wff setvar class |
| This definition is used by: nfso 5581 sopo 5593 soss 5594 soeq1 5595 solin 5601 issod 5609 so0 5612 soinxp 5748 sosn 5753 cnvso 6296 isosolem 7356 sorpss 7738 dfwe2 7782 epweon 7783 soxp 8134 soseq 8164 sornom 10279 zorn2lem6 10503 tosso 18498 dfso3 36232 dfso2 36267 |
| Copyright terms: Public domain | W3C validator |