MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  poirr2 Structured version   Visualization version   GIF version

Theorem poirr2 6123
Description: A partial order is irreflexive. (Contributed by Mario Carneiro, 2-Nov-2015.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)
Assertion
Ref Expression
poirr2 (𝑅 Po 𝐴 → (𝑅 ∩ ( I ↾ 𝐴)) = ∅)

Proof of Theorem poirr2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relres 6000 . . . 4 Rel ( I ↾ 𝐴)
2 relin2 5795 . . . 4 (Rel ( I ↾ 𝐴) → Rel (𝑅 ∩ ( I ↾ 𝐴)))
31, 2mp1i 14 . . 3 (𝑅 Po 𝐴 → Rel (𝑅 ∩ ( I ↾ 𝐴)))
4 df-br 5106 . . . . 5 (𝑥(𝑅 ∩ ( I ↾ 𝐴))𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ ( I ↾ 𝐴)))
5 brin 5159 . . . . 5 (𝑥(𝑅 ∩ ( I ↾ 𝐴))𝑦 ↔ (𝑥𝑅𝑦 ∧ 𝑥( I ↾ 𝐴)𝑦))
64, 5bitr3i 280 . . . 4 (⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ ( I ↾ 𝐴)) ↔ (𝑥𝑅𝑦 ∧ 𝑥( I ↾ 𝐴)𝑦))
7 vex 3457 . . . . . . . . 9 𝑦 ∈ V
87brresi 5983 . . . . . . . 8 (𝑥( I ↾ 𝐴)𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 I 𝑦))
9 poirr 5574 . . . . . . . . . 10 ((𝑅 Po 𝐴 ∧ 𝑥 ∈ 𝐴) → ¬ 𝑥𝑅𝑥)
107ideq 5834 . . . . . . . . . . . 12 (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
11 breq2 5109 . . . . . . . . . . . 12 (𝑥 = 𝑦 → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑦))
1210, 11sylbi 220 . . . . . . . . . . 11 (𝑥 I 𝑦 → (𝑥𝑅𝑥 ↔ 𝑥𝑅𝑦))
1312notbid 321 . . . . . . . . . 10 (𝑥 I 𝑦 → (¬ 𝑥𝑅𝑥 ↔ ¬ 𝑥𝑅𝑦))
149, 13syl5ibcom 248 . . . . . . . . 9 ((𝑅 Po 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 I 𝑦 → ¬ 𝑥𝑅𝑦))
1514expimpd 459 . . . . . . . 8 (𝑅 Po 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑥 I 𝑦) → ¬ 𝑥𝑅𝑦))
168, 15biimtrid 245 . . . . . . 7 (𝑅 Po 𝐴 → (𝑥( I ↾ 𝐴)𝑦 → ¬ 𝑥𝑅𝑦))
1716con2d 135 . . . . . 6 (𝑅 Po 𝐴 → (𝑥𝑅𝑦 → ¬ 𝑥( I ↾ 𝐴)𝑦))
18 imnan 405 . . . . . 6 ((𝑥𝑅𝑦 → ¬ 𝑥( I ↾ 𝐴)𝑦) ↔ ¬ (𝑥𝑅𝑦 ∧ 𝑥( I ↾ 𝐴)𝑦))
1917, 18sylib 221 . . . . 5 (𝑅 Po 𝐴 → ¬ (𝑥𝑅𝑦 ∧ 𝑥( I ↾ 𝐴)𝑦))
2019pm2.21d 122 . . . 4 (𝑅 Po 𝐴 → ((𝑥𝑅𝑦 ∧ 𝑥( I ↾ 𝐴)𝑦) → ⟨𝑥, 𝑦⟩ ∈ ∅))
216, 20biimtrid 245 . . 3 (𝑅 Po 𝐴 → (⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ ( I ↾ 𝐴)) → ⟨𝑥, 𝑦⟩ ∈ ∅))
223, 21relssdv 5768 . 2 (𝑅 Po 𝐴 → (𝑅 ∩ ( I ↾ 𝐴)) ⊆ ∅)
23 ss0 4354 . 2 ((𝑅 ∩ ( I ↾ 𝐴)) ⊆ ∅ → (𝑅 ∩ ( I ↾ 𝐴)) = ∅)
2422, 23syl 18 1 (𝑅 Po 𝐴 → (𝑅 ∩ ( I ↾ 𝐴)) = ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146   ⊆ wss 3899   ∩ cin 4091  ∅c0 4280  ⟨cop 4837   class class class wbr 5105   I cid 5548   Po wpo 5560   ↾ cres 5656  Rel wrel 5659
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  ax-sep 5251  ax-pr 5394
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 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-id 5549  df-po 5562  df-xp 5660  df-rel 5661  df-res 5666
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator