Theorem weinxp 5717

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 5715	. . 3 ⊢ (𝑅 Fr 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴)
2		soinxp 5714	. . 3 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)
3	1, 2	anbi12i 629	. 2 ⊢ ((𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
4		df-we 5587	. 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ 𝑅 Or 𝐴))
5		df-we 5587	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) We 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Fr 𝐴 ∧ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴))
6	3, 4, 5	3bitr4i 303	1 ⊢ (𝑅 We 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) We 𝐴)

Syntax hints:   ↔ wb 206   ∧ wa 395   ∩ cin 3902   Or wor 5539   Fr wfr 5582   We wwe 5584   × cxp 5630

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 5243  ax-pr 5379

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 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638

This theorem is referenced by:  wemapwe  9618  infxpenlem  9935  dfac8b  9953  ac10ct  9956  canthwelem  10573  ltbwe  22011  vitali  25582  fin2so  37847  dnwech  43394  aomclem5  43404