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

Theorem qfto 5981
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 5591 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
2 brun 5117 . . . . 5 (𝑥(𝑅𝑅)𝑦 ↔ (𝑥𝑅𝑦𝑥𝑅𝑦))
3 df-br 5067 . . . . 5 (𝑥(𝑅𝑅)𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅))
4 vex 3497 . . . . . . 7 𝑥 ∈ V
5 vex 3497 . . . . . . 7 𝑦 ∈ V
64, 5brcnv 5753 . . . . . 6 (𝑥𝑅𝑦𝑦𝑅𝑥)
76orbi2i 909 . . . . 5 ((𝑥𝑅𝑦𝑥𝑅𝑦) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
82, 3, 73bitr3i 303 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
91, 8imbi12i 353 . . 3 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)) ↔ ((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
1092albii 1821 . 2 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
11 relxp 5573 . . 3 Rel (𝐴 × 𝐵)
12 ssrel 5657 . . 3 (Rel (𝐴 × 𝐵) → ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅))))
1311, 12ax-mp 5 . 2 ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) → ⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅)))
14 r2al 3201 . 2 (∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝑦((𝑥𝐴𝑦𝐵) → (𝑥𝑅𝑦𝑦𝑅𝑥)))
1510, 13, 143bitr4i 305 1 ((𝐴 × 𝐵) ⊆ (𝑅𝑅) ↔ ∀𝑥𝐴𝑦𝐵 (𝑥𝑅𝑦𝑦𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  wo 843  wal 1535  wcel 2114  wral 3138  cun 3934  wss 3936  cop 4573   class class class wbr 5066   × cxp 5553  ccnv 5554  Rel wrel 5560
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-br 5067  df-opab 5129  df-xp 5561  df-rel 5562  df-cnv 5563
This theorem is referenced by:  istsr2  17828  letsr  17837
  Copyright terms: Public domain W3C validator