Theorem po2ne 5571

Description: Two sets related by a partial order are not equal. (Contributed by AV, 13-Mar-2023.)

Assertion

Ref	Expression
po2ne	⊢ ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴𝑅𝐵) → 𝐴 ≠ 𝐵)

Proof of Theorem po2ne

Step	Hyp	Ref	Expression
1		breq1 5105	. . . . 5 ⊢ (𝐴 = 𝐵 → (𝐴𝑅𝐵 ↔ 𝐵𝑅𝐵))
2		poirr 5567	. . . . . . . . 9 ⊢ ((𝑅 Po 𝑉 ∧ 𝐵 ∈ 𝑉) → ¬ 𝐵𝑅𝐵)
3	2	adantrl 729	. . . . . . . 8 ⊢ ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → ¬ 𝐵𝑅𝐵)
4	3	pm2.21d 122	. . . . . . 7 ⊢ ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → (𝐵𝑅𝐵 → 𝐴 ≠ 𝐵))
5	4	ex 418	. . . . . 6 ⊢ (𝑅 Po 𝑉 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐵𝑅𝐵 → 𝐴 ≠ 𝐵)))
6	5	com13 89	. . . . 5 ⊢ (𝐵𝑅𝐵 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝑅 Po 𝑉 → 𝐴 ≠ 𝐵)))
7	1, 6	biimtrdi 256	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴𝑅𝐵 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝑅 Po 𝑉 → 𝐴 ≠ 𝐵))))
8	7	com24 96	. . 3 ⊢ (𝐴 = 𝐵 → (𝑅 Po 𝑉 → ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) → (𝐴𝑅𝐵 → 𝐴 ≠ 𝐵))))
9	8	3impd 1367	. 2 ⊢ (𝐴 = 𝐵 → ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴𝑅𝐵) → 𝐴 ≠ 𝐵))
10		ax-1 6	. 2 ⊢ (𝐴 ≠ 𝐵 → ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴𝑅𝐵) → 𝐴 ≠ 𝐵))
11	9, 10	pm2.61ine 3038	1 ⊢ ((𝑅 Po 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉) ∧ 𝐴𝑅𝐵) → 𝐴 ≠ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955   class class class wbr 5102   Po wpo 5553

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-po 5555

This theorem is used by:  chnpof1  18766  prproropf1olem1  48507