Theorem weinxp 5707

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

Step	Hyp	Ref	Expression
1		frinxp 5705	. . 3 ⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
2		soinxp 5704	. . 3 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
3	1, 2	anbi12i 629	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
4		df-we 5577	. 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴))
5		df-we 5577	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
6	3, 4, 5	3bitr4i 303	1 ⊢ (𝑅 We 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) We 𝐴)

Syntax hints:   ↔ wb 206   ∧ wa 395   ∩ cin 3889   Or wor 5529   Fr wfr 5572   We wwe 5574   × cxp 5620

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-po 5530  df-so 5531  df-fr 5575  df-we 5577  df-xp 5628

This theorem is referenced by:  wemapwe  9607  infxpenlem  9924  dfac8b  9942  ac10ct  9945  canthwelem  10562  ltbwe  22031  vitali  25589  fin2so  37939  dnwech  43491  aomclem5  43501