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

Theorem intirr 6083
Description: Two ways of saying a relation is irreflexive. Definition of irreflexivity in [Schechter] p. 51. (Contributed by NM, 9-Sep-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
intirr ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
Distinct variable group:   𝑥,𝑅

Proof of Theorem intirr
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 incom 4163 . . . 4 (𝑅 ∩ I ) = ( I ∩ 𝑅)
21eqeq1i 2742 . . 3 ((𝑅 ∩ I ) = ∅ ↔ ( I ∩ 𝑅) = ∅)
3 disj2 4412 . . 3 (( I ∩ 𝑅) = ∅ ↔ I ⊆ (V ∖ 𝑅))
4 reli 5783 . . . 4 Rel I
5 ssrel 5740 . . . 4 (Rel I → ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))))
64, 5ax-mp 5 . . 3 ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
72, 3, 63bitri 297 . 2 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
8 equcom 2020 . . . . 5 (𝑦 = 𝑥𝑥 = 𝑦)
9 vex 3446 . . . . . 6 𝑦 ∈ V
109ideq 5809 . . . . 5 (𝑥 I 𝑦𝑥 = 𝑦)
11 df-br 5101 . . . . 5 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
128, 10, 113bitr2i 299 . . . 4 (𝑦 = 𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
13 opex 5419 . . . . . . 7 𝑥, 𝑦⟩ ∈ V
1413biantrur 530 . . . . . 6 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
15 eldif 3913 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1614, 15bitr4i 278 . . . . 5 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
17 df-br 5101 . . . . 5 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1816, 17xchnxbir 333 . . . 4 𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
1912, 18imbi12i 350 . . 3 ((𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
20192albii 1822 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
21 breq2 5104 . . . . 5 (𝑦 = 𝑥 → (𝑥𝑅𝑦𝑥𝑅𝑥))
2221notbid 318 . . . 4 (𝑦 = 𝑥 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑥))
2322equsalvw 2006 . . 3 (∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ¬ 𝑥𝑅𝑥)
2423albii 1821 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
257, 20, 243bitr2i 299 1 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1540   = wceq 1542  wcel 2114  Vcvv 3442  cdif 3900  cin 3902  wss 3903  c0 4287  cop 4588   class class class wbr 5100   I cid 5526  Rel wrel 5637
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5243  ax-pr 5379
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-id 5527  df-xp 5638  df-rel 5639
This theorem is referenced by:  hartogslem1  9459  hausdiag  23601
  Copyright terms: Public domain W3C validator