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

Theorem soinxp 5659
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 5658 . . 3 (𝑅 Po 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴)
2 brinxp 5656 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑥𝑅𝑦𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
3 biidd 261 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑥 = 𝑦𝑥 = 𝑦))
4 brinxp 5656 . . . . . . 7 ((𝑦𝐴𝑥𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
54ancoms 458 . . . . . 6 ((𝑥𝐴𝑦𝐴) → (𝑦𝑅𝑥𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
62, 3, 53orbi123d 1433 . . . . 5 ((𝑥𝐴𝑦𝐴) → ((𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
76ralbidva 3119 . . . 4 (𝑥𝐴 → (∀𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
87ralbiia 3089 . . 3 (∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥))
91, 8anbi12i 626 . 2 ((𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
10 df-so 5495 . 2 (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥𝑅𝑦𝑥 = 𝑦𝑦𝑅𝑥)))
11 df-so 5495 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦𝑥 = 𝑦𝑦(𝑅 ∩ (𝐴 × 𝐴))𝑥)))
129, 10, 113bitr4i 302 1 (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  w3o 1084  wcel 2108  wral 3063  cin 3882   class class class wbr 5070   Po wpo 5492   Or wor 5493   × cxp 5578
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-po 5494  df-so 5495  df-xp 5586
This theorem is referenced by:  weinxp  5662  ltsopi  10575  cnso  15884  opsrtoslem2  21173
  Copyright terms: Public domain W3C validator