Theorem soinxp 4789

Description: Intersection of linear order with cross 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.

Step	Hyp	Ref	Expression
1		poinxp 4788	. . 3 ⊢ (𝑅 Po 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴)
2		brinxp 4787	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
3	2	3adant3 1041	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
4		brinxp 4787	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧))
5	4	3adant2 1040	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧))
6		brinxp 4787	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
7	6	ancoms 268	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
8	7	3adant1 1039	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
9	5, 8	orbi12d 798	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦)))
10	3, 9	imbi12d 234	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
11	10	3expb 1228	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
12	11	2ralbidva 2552	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
13	12	ralbiia 2544	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦)))
14	1, 13	anbi12i 460	. 2 ⊢ ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
15		df-iso 4388	. 2 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
16		df-iso 4388	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
17	14, 15, 16	3bitr4i 212	1 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 713   ∧ w3a 1002   ∈ wcel 2200  ∀wral 2508   ∩ cin 3196   class class class wbr 4083   Po wpo 4385   Or wor 4386   × cxp 4717

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4084  df-opab 4146  df-po 4387  df-iso 4388  df-xp 4725

This theorem is referenced by: (None)