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

Theorem weinxp 5673
Description: Intersection of well-ordering with Cartesian product of its field. (Contributed by NM, 9-Mar-1997.) (Revised by Mario Carneiro, 10-Jul-2014.)
Assertion
Ref Expression
weinxp (𝑅 We 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) We 𝐴)

Proof of Theorem weinxp
StepHypRef Expression
1 frinxp 5671 . . 3 (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
2 soinxp 5670 . . 3 (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
31, 2anbi12i 626 . 2 ((𝑅 Fr 𝐴𝑅 Or 𝐴) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
4 df-we 5548 . 2 (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴𝑅 Or 𝐴))
5 df-we 5548 . 2 ((𝑅 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
63, 4, 53bitr4i 302 1 (𝑅 We 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) We 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 395  cin 3888   Or wor 5504   Fr wfr 5543   We wwe 5545   × cxp 5589
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2103  ax-9 2111  ax-ext 2704  ax-sep 5226  ax-nul 5233  ax-pr 5355
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2063  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3060  df-rex 3069  df-rab 3224  df-v 3436  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4260  df-if 4463  df-sn 4565  df-pr 4567  df-op 4571  df-br 5078  df-opab 5140  df-po 5505  df-so 5506  df-fr 5546  df-we 5548  df-xp 5597
This theorem is referenced by:  wemapwe  9483  infxpenlem  9797  dfac8b  9815  ac10ct  9818  canthwelem  10434  ltbwe  21273  vitali  24805  fin2so  35792  dnwech  40897  aomclem5  40907
  Copyright terms: Public domain W3C validator