| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qfto | Structured version Visualization version GIF version | ||
| Description: A quantifier-free way of expressing the total order predicate. (Contributed by Mario Carneiro, 22-Nov-2013.) |
| Ref | Expression |
|---|---|
| qfto | ⊢ ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelxp 5683 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 2 | brun 5151 | . . . . 5 ⊢ (𝑥(𝑅 ∪ ◡𝑅)𝑦 ↔ (𝑥𝑅𝑦 ∨ 𝑥◡𝑅𝑦)) | |
| 3 | df-br 5101 | . . . . 5 ⊢ (𝑥(𝑅 ∪ ◡𝑅)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) | |
| 4 | vex 3458 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 5 | vex 3458 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | brcnv 5854 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥) |
| 7 | 6 | orbi2i 923 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∨ 𝑥◡𝑅𝑦) ↔ (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| 8 | 2, 3, 7 | 3bitr3i 303 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅) ↔ (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| 9 | 1, 8 | imbi12i 352 | . . 3 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) |
| 10 | 9 | 2albii 1840 | . 2 ⊢ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) |
| 11 | relxp 5665 | . . 3 ⊢ Rel (𝐴 × 𝐵) | |
| 12 | ssrel 5755 | . . 3 ⊢ (Rel (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)))) | |
| 13 | 11, 12 | ax-mp 5 | . 2 ⊢ ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅))) |
| 14 | r2al 3198 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) | |
| 15 | 10, 13, 14 | 3bitr4i 305 | 1 ⊢ ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 ∀wal 1558 ∈ wcel 2142 ∀wral 3076 ∪ cun 3902 ⊆ wss 3904 〈cop 4588 class class class wbr 5100 × cxp 5645 ◡ccnv 5646 Rel wrel 5652 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5653 df-rel 5654 df-cnv 5655 |
| This theorem is referenced by: istsr2 18616 letsr 18625 |
| Copyright terms: Public domain | W3C validator |