| 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 5687 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 2 | brun 5155 | . . . . 5 ⊢ (𝑥(𝑅 ∪ ◡𝑅)𝑦 ↔ (𝑥𝑅𝑦 ∨ 𝑥◡𝑅𝑦)) | |
| 3 | df-br 5103 | . . . . 5 ⊢ (𝑥(𝑅 ∪ ◡𝑅)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) | |
| 4 | vex 3454 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 5 | vex 3454 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 6 | 4, 5 | brcnv 5861 | . . . . . 6 ⊢ (𝑥◡𝑅𝑦 ↔ 𝑦𝑅𝑥) |
| 7 | 6 | orbi2i 926 | . . . . 5 ⊢ ((𝑥𝑅𝑦 ∨ 𝑥◡𝑅𝑦) ↔ (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| 8 | 2, 3, 7 | 3bitr3i 304 | . . . 4 ⊢ (〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅) ↔ (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| 9 | 1, 8 | imbi12i 353 | . . 3 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) |
| 10 | 9 | 2albii 1852 | . 2 ⊢ (∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) |
| 11 | relxp 5669 | . . 3 ⊢ Rel (𝐴 × 𝐵) | |
| 12 | ssrel 5760 | . . 3 ⊢ (Rel (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅)))) | |
| 13 | 11, 12 | ax-mp 5 | . 2 ⊢ ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥∀𝑦(〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝑅 ∪ ◡𝑅))) |
| 14 | r2al 3198 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥) ↔ ∀𝑥∀𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥))) | |
| 15 | 10, 13, 14 | 3bitr4i 306 | 1 ⊢ ((𝐴 × 𝐵) ⊆ (𝑅 ∪ ◡𝑅) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑥𝑅𝑦 ∨ 𝑦𝑅𝑥)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∀wal 1567 ∈ wcel 2144 ∀wral 3076 ⊆ wss 3896 ∪ cun 4148 〈cop 4834 class class class wbr 5102 × cxp 5649 ◡ccnv 5650 Rel wrel 5656 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3897 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 df-br 5103 df-opab 5167 df-xp 5657 df-rel 5658 df-cnv 5659 |
| This theorem is used by: istsr2 18767 letsr 18776 |
| Copyright terms: Public domain | W3C validator |