Theorem swopo 4223

Description: A strict weak order is a partial order. (Contributed by Mario Carneiro, 9-Jul-2014.)

Hypotheses

Ref	Expression
swopo.1	⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
swopo.2	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)))

Assertion

Ref	Expression
swopo	⊢ (𝜑 → 𝑅 Po 𝐴)

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Proof of Theorem swopo

Step	Hyp	Ref	Expression
1		id 19	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐴)
2	1	ancli 321	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
3		swopo.1	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
4	3	ralrimivva 2512	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
5		breq1 3927	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑥𝑅𝑧))
6		breq2 3928	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑥))
7	6	notbid 656	. . . . . 6 ⊢ (𝑦 = 𝑥 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝑥))
8	5, 7	imbi12d 233	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦) ↔ (𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥)))
9		breq2 3928	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑥𝑅𝑧 ↔ 𝑥𝑅𝑥))
10		breq1 3927	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑧𝑅𝑥 ↔ 𝑥𝑅𝑥))
11	10	notbid 656	. . . . . 6 ⊢ (𝑧 = 𝑥 → (¬ 𝑧𝑅𝑥 ↔ ¬ 𝑥𝑅𝑥))
12	9, 11	imbi12d 233	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥) ↔ (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥)))
13	8, 12	rspc2va 2798	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦)) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
14	2, 4, 13	syl2anr 288	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
15	14	pm2.01d 607	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
16	3	3adantr1 1140	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
17		swopo.2	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)))
18	17	imp 123	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))
19	18	orcomd 718	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑧𝑅𝑦 ∨ 𝑥𝑅𝑧))
20	19	ord 713	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (¬ 𝑧𝑅𝑦 → 𝑥𝑅𝑧))
21	20	expimpd 360	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ ¬ 𝑧𝑅𝑦) → 𝑥𝑅𝑧))
22	16, 21	sylan2d 292	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
23	15, 22	ispod 4221	1 ⊢ (𝜑 → 𝑅 Po 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ∨ wo 697   ∧ w3a 962   ∈ wcel 1480  ∀wral 2414   class class class wbr 3924   Po wpo 4211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-po 4213

This theorem is referenced by:  swoer  6450