MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  qfto Structured version   Visualization version   GIF version

Theorem qfto 5418
Description: A quantifier-free way of expressing the total order predicate. (Contributed by Mario Carneiro, 22-Nov-2013.)
Assertion
Ref Expression
qfto ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦

Proof of Theorem qfto
StepHypRef Expression
1 opelxp 5055 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
2 brun 4622 . . . . 5 (𝑥(𝑅𝑅)𝑦 ↔ (𝑥𝑅𝑦𝑥𝑅𝑦))
3 df-br 4573 . . . . 5 (𝑥(𝑅𝑅)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅))
4 vex 3170 . . . . . . 7 𝑥 ∈ V
5 vex 3170 . . . . . . 7 𝑦 ∈ V
64, 5brcnv 5210 . . . . . 6 (𝑥𝑅𝑦𝑦𝑅𝑥)
76orbi2i 539 . . . . 5 ((𝑥𝑅𝑦𝑥𝑅𝑦) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
82, 3, 73bitr3i 288 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
91, 8imbi12i 338 . . 3 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)) ↔ ((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
1092albii 1736 . 2 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
11 relxp 5134 . . 3 Rel (𝐴 × 𝐵)
12 ssrel 5115 . . 3 (Rel (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅))))
1311, 12ax-mp 5 . 2 ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)))
14 r2al 2917 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
1510, 13, 143bitr4i 290 1 ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  wo 381  wa 382  wal 1472  wcel 1975  wral 2890  cun 3532  wss 3534  cop 4125   class class class wbr 4572   × cxp 5021  ccnv 5022  Rel wrel 5028
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1711  ax-4 1726  ax-5 1825  ax-6 1873  ax-7 1920  ax-9 1984  ax-10 2004  ax-11 2019  ax-12 2031  ax-13 2227  ax-ext 2584  ax-sep 4698  ax-nul 4707  ax-pr 4823
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1866  df-eu 2456  df-mo 2457  df-clab 2591  df-cleq 2597  df-clel 2600  df-nfc 2734  df-ral 2895  df-rex 2896  df-rab 2899  df-v 3169  df-dif 3537  df-un 3539  df-in 3541  df-ss 3548  df-nul 3869  df-if 4031  df-sn 4120  df-pr 4122  df-op 4126  df-br 4573  df-opab 4633  df-xp 5029  df-rel 5030  df-cnv 5031
This theorem is referenced by:  istsr2  16982  letsr  16991
  Copyright terms: Public domain W3C validator