Theorem soinxp 4711

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 4710	. . 3 ⊢ (𝑅 Po 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴)
2		brinxp 4709	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
3	2	3adant3 1019	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦))
4		brinxp 4709	. . . . . . . . 9 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧))
5	4	3adant2 1018	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑥𝑅𝑧 ↔ 𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧))
6		brinxp 4709	. . . . . . . . . 10 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
7	6	ancoms 268	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
8	7	3adant1 1017	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝑧𝑅𝑦 ↔ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))
9	5, 8	orbi12d 794	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦)))
10	3, 9	imbi12d 234	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
11	10	3expb 1206	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
12	11	2ralbidva 2512	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
13	12	ralbiia 2504	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦)))
14	1, 13	anbi12i 460	. 2 ⊢ ((𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))) ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
15		df-iso 4312	. 2 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))))
16		df-iso 4312	. 2 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴 ↔ ((𝑅 ∩ (𝐴 × 𝐴)) Po 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑦 → (𝑥(𝑅 ∩ (𝐴 × 𝐴))𝑧 ∨ 𝑧(𝑅 ∩ (𝐴 × 𝐴))𝑦))))
17	14, 15, 16	3bitr4i 212	1 ⊢ (𝑅 Or 𝐴 ↔ (𝑅 ∩ (𝐴 × 𝐴)) Or 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 709   ∧ w3a 980   ∈ wcel 2160  ∀wral 2468   ∩ cin 3143   class class class wbr 4018   Po wpo 4309   Or wor 4310   × cxp 4639

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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-br 4019  df-opab 4080  df-po 4311  df-iso 4312  df-xp 4647

This theorem is referenced by: (None)