Theorem weinxp 5737

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 5735	. . 3 ⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
2		soinxp 5734	. . 3 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
3	1, 2	anbi12i 639	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
4		df-we 5607	. 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴))
5		df-we 5607	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
6	3, 4, 5	3bitr4i 306	1 ⊢ (𝑅 We 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) We 𝐴)

Syntax hints:   ↔ wb 209   ∧ wa 400   ∩ cin 3906   Or wor 5559   Fr wfr 5602   We wwe 5604   × cxp 5650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-po 5560  df-so 5561  df-fr 5605  df-we 5607  df-xp 5658

This theorem is referenced by:  wemapwe  9654  infxpenlem  9985  dfac8b  10003  ac10ct  10006  canthwelem  10623  ltbwe  22155  vitali  25733  fin2so  38118  dnwech  43637  aomclem5  43647