Theorem swopo 4291

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 2552	. . . 4 ⊢ (𝜑 → ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
5		breq1 3992	. . . . . 6 ⊢ (𝑦 = 𝑥 → (𝑦𝑅𝑧 ↔ 𝑥𝑅𝑧))
6		breq2 3993	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑥))
7	6	notbid 662	. . . . . 6 ⊢ (𝑦 = 𝑥 → (¬ 𝑧𝑅𝑦 ↔ ¬ 𝑧𝑅𝑥))
8	5, 7	imbi12d 233	. . . . 5 ⊢ (𝑦 = 𝑥 → ((𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦) ↔ (𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥)))
9		breq2 3993	. . . . . 6 ⊢ (𝑧 = 𝑥 → (𝑥𝑅𝑧 ↔ 𝑥𝑅𝑥))
10		breq1 3992	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (𝑧𝑅𝑥 ↔ 𝑥𝑅𝑥))
11	10	notbid 662	. . . . . 6 ⊢ (𝑧 = 𝑥 → (¬ 𝑧𝑅𝑥 ↔ ¬ 𝑥𝑅𝑥))
12	9, 11	imbi12d 233	. . . . 5 ⊢ (𝑧 = 𝑥 → ((𝑥𝑅𝑧 → ¬ 𝑧𝑅𝑥) ↔ (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥)))
13	8, 12	rspc2va 2848	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦)) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
14	2, 4, 13	syl2anr 288	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝑥𝑅𝑥 → ¬ 𝑥𝑅𝑥))
15	14	pm2.01d 613	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
16	3	3adantr1 1151	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑦𝑅𝑧 → ¬ 𝑧𝑅𝑦))
17		swopo.2	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → (𝑥𝑅𝑦 → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦)))
18	17	imp 123	. . . . . 6 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑥𝑅𝑧 ∨ 𝑧𝑅𝑦))
19	18	orcomd 724	. . . . 5 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (𝑧𝑅𝑦 ∨ 𝑥𝑅𝑧))
20	19	ord 719	. . . 4 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) ∧ 𝑥𝑅𝑦) → (¬ 𝑧𝑅𝑦 → 𝑥𝑅𝑧))
21	20	expimpd 361	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ ¬ 𝑧𝑅𝑦) → 𝑥𝑅𝑧))
22	16, 21	sylan2d 292	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
23	15, 22	ispod 4289	1 ⊢ (𝜑 → 𝑅 Po 𝐴)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103   ∨ wo 703   ∧ w3a 973   ∈ wcel 2141  ∀wral 2448   class class class wbr 3989   Po wpo 4279

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 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-po 4281

This theorem is referenced by:  swoer  6541