Theorem swopo 5514

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 22	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐴)
2	1	ancli 549	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
3		swopo.1	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
4	3	ralrimivva 3123	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
5		breq1 5077	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑥𝑅𝑧))
6		breq2 5078	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑥))
7	6	notbid 318	. . . . . 6 ⊢ (𝑦 = 𝑥 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝑥))
8	5, 7	imbi12d 345	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦) ↔ (𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥)))
9		breq2 5078	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑥𝑅𝑧 ↔ 𝑥𝑅𝑥))
10		breq1 5077	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑧𝑅𝑥 ↔ 𝑥𝑅𝑥))
11	10	notbid 318	. . . . . 6 ⊢ (𝑧 = 𝑥 → (¬ 𝑧𝑅𝑥 ↔ ¬ 𝑥𝑅𝑥))
12	9, 11	imbi12d 345	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥) ↔ (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥)))
13	8, 12	rspc2va 3571	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦)) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
14	2, 4, 13	syl2anr 597	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
15	14	pm2.01d 189	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
16	3	3adantr1 1168	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
17		swopo.2	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)))
18	17	imp 407	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))
19	18	orcomd 868	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑧𝑅𝑦 ∨ 𝑥𝑅𝑧))
20	19	ord 861	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (¬ 𝑧𝑅𝑦 → 𝑥𝑅𝑧))
21	20	expimpd 454	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ ¬ 𝑧𝑅𝑦) → 𝑥𝑅𝑧))
22	16, 21	sylan2d 605	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
23	15, 22	ispod 5512	1 ⊢ (𝜑 → 𝑅 Po 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 396   ∨ wo 844   ∧ w3a 1086   ∈ wcel 2106  ∀wral 3064   class class class wbr 5074   Po wpo 5501

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-po 5503

This theorem is referenced by:  swoer  8528  swoso  8531