Theorem poeq1 5566

Description: Equality theorem for partial ordering predicate. (Contributed by NM, 27-Mar-1997.)

Assertion

Ref	Expression
poeq1	⊢ (𝑅 = 𝑆 → (𝑅 Po 𝐴 ↔ 𝑆 Po 𝐴))

Proof of Theorem poeq1

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

Step	Hyp	Ref	Expression
1		breq 5108	. . . . . 6 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑥 ↔ 𝑥𝑆𝑥))
2	1	notbid 321	. . . . 5 ⊢ (𝑅 = 𝑆 → (¬ 𝑥𝑅𝑥 ↔ ¬ 𝑥𝑆𝑥))
3		breq 5108	. . . . . . 7 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑦 ↔ 𝑥𝑆𝑦))
4		breq 5108	. . . . . . 7 ⊢ (𝑅 = 𝑆 → (𝑦𝑅𝑧 ↔ 𝑦𝑆𝑧))
5	3, 4	anbi12d 644	. . . . . 6 ⊢ (𝑅 = 𝑆 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ↔ (𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧)))
6		breq 5108	. . . . . 6 ⊢ (𝑅 = 𝑆 → (𝑥𝑅𝑧 ↔ 𝑥𝑆𝑧))
7	5, 6	imbi12d 347	. . . . 5 ⊢ (𝑅 = 𝑆 → (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧)))
8	2, 7	anbi12d 644	. . . 4 ⊢ (𝑅 = 𝑆 → ((¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ (¬ 𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
9	8	ralbidv 3189	. . 3 ⊢ (𝑅 = 𝑆 → (∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
10	9	2ralbidv 3230	. 2 ⊢ (𝑅 = 𝑆 → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧))))
11		df-po 5563	. 2 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑅𝑥 ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
12		df-po 5563	. 2 ⊢ (𝑆 Po 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 (¬ 𝑥𝑆𝑥 ∧ ((𝑥𝑆𝑦 ∧ 𝑦𝑆𝑧) → 𝑥𝑆𝑧)))
13	10, 11, 12	3bitr4g 317	1 ⊢ (𝑅 = 𝑆 → (𝑅 Po 𝐴 ↔ 𝑆 Po 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∀wral 3080   class class class wbr 5106   Po wpo 5561

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-cleq 2755  df-clel 2839  df-ral 3081  df-br 5107  df-po 5563

This theorem is used by:  poeq12d  5568  soeq1  5584