Theorem pocl 5566

Description: Characteristic properties of a partial order in class notation. (Contributed by NM, 27-Mar-1997.) Reduce axiom usage and shorten proof. (Revised by GG, 3-Oct-2024.)

Assertion

Ref	Expression
pocl	⊢ (𝑅 Po 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))))

Proof of Theorem pocl

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-po 5558	. . 3 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
2	1	biimpi 219	. 2 ⊢ (𝑅 Po 𝐴 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
3		id 23	. . . . . 6 ⊢ (𝑥 = 𝐵 → 𝑥 = 𝐵)
4	3, 3	breq12d 5115	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝑥 ↔ 𝐵𝑅𝐵))
5	4	notbid 321	. . . 4 ⊢ (𝑥 = 𝐵 → (¬ 𝑥𝑅𝑥 ↔ ¬ 𝐵𝑅𝐵))
6		breq1 5105	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝑦 ↔ 𝐵𝑅𝑦))
7	6	anbi1d 643	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ↔ (𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧)))
8		breq1 5105	. . . . 5 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝑧 ↔ 𝐵𝑅𝑧))
9	7, 8	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝐵 → (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ((𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝐵𝑅𝑧)))
10	5, 9	anbi12d 644	. . 3 ⊢ (𝑥 = 𝐵 → ((¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝐵𝑅𝑧))))
11		breq2 5106	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝐵𝑅𝑦 ↔ 𝐵𝑅𝐶))
12		breq1 5105	. . . . . 6 ⊢ (𝑦 = 𝐶 → (𝑦𝑅𝑧 ↔ 𝐶𝑅𝑧))
13	11, 12	anbi12d 644	. . . . 5 ⊢ (𝑦 = 𝐶 → ((𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧) ↔ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧)))
14	13	imbi1d 344	. . . 4 ⊢ (𝑦 = 𝐶 → (((𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝐵𝑅𝑧) ↔ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧) → 𝐵𝑅𝑧)))
15	14	anbi2d 642	. . 3 ⊢ (𝑦 = 𝐶 → ((¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝐵𝑅𝑧)) ↔ (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧) → 𝐵𝑅𝑧))))
16		breq2 5106	. . . . . 6 ⊢ (𝑧 = 𝐷 → (𝐶𝑅𝑧 ↔ 𝐶𝑅𝐷))
17	16	anbi2d 642	. . . . 5 ⊢ (𝑧 = 𝐷 → ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧) ↔ (𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷)))
18		breq2 5106	. . . . 5 ⊢ (𝑧 = 𝐷 → (𝐵𝑅𝑧 ↔ 𝐵𝑅𝐷))
19	17, 18	imbi12d 347	. . . 4 ⊢ (𝑧 = 𝐷 → (((𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧) → 𝐵𝑅𝑧) ↔ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷)))
20	19	anbi2d 642	. . 3 ⊢ (𝑧 = 𝐷 → ((¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝑧) → 𝐵𝑅𝑧)) ↔ (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))))
21	10, 15, 20	rspc3v 3591	. 2 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))))
22	2, 21	syl5com 32	1 ⊢ (𝑅 Po 𝐴 → ((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐴) → (¬ 𝐵𝑅𝐵 ∧ ((𝐵𝑅𝐶 ∧ 𝐶𝑅𝐷) → 𝐵𝑅𝐷))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   class class class wbr 5102   Po wpo 5556

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-po 5558

This theorem is used by:  poirr  5570  potr  5571