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

Theorem soinxp 5770
Description: Intersection of total order with Cartesian product of its field. (Contributed by Mario Carneiro, 10-Jul-2014.)
Assertion
Ref Expression
soinxp (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)

Proof of Theorem soinxp
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 poinxp 5769 . . 3 (𝑅 Po 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴)
2 brinxp 5767 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
3 biidd 262 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑥 = 𝑦𝑥 = 𝑦))
4 brinxp 5767 . . . . . . 7 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
54ancoms 458 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
62, 3, 53orbi123d 1434 . . . . 5 ((𝑥𝐴𝑦𝐴) → ((𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
76ralbidva 3174 . . . 4 (𝑥𝐴 → (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
87ralbiia 3089 . . 3 (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
91, 8anbi12i 628 . 2 ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
10 df-so 5598 . 2 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
11 df-so 5598 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
129, 10, 113bitr4i 303 1 (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395  w3o 1085  wcel 2106  wral 3059  cin 3962   class class class wbr 5148   Po wpo 5595   Or wor 5596   × cxp 5687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pr 5438
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-sn 4632  df-pr 4634  df-op 4638  df-br 5149  df-opab 5211  df-po 5597  df-so 5598  df-xp 5695
This theorem is referenced by:  weinxp  5773  ltsopi  10926  cnso  16280  opsrtoslem2  22098
  Copyright terms: Public domain W3C validator