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

Theorem intirr 6062
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 4157 . . . 4 (𝑅 ∩ I ) = ( I ∩ 𝑅)
21eqeq1i 2735 . . 3 ((𝑅 ∩ I ) = ∅ ↔ ( I ∩ 𝑅) = ∅)
3 disj2 4406 . . 3 (( I ∩ 𝑅) = ∅ ↔ I ⊆ (V ∖ 𝑅))
4 reli 5764 . . . 4 Rel I
5 ssrel 5721 . . . 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 2019 . . . . 5 (𝑦 = 𝑥𝑥 = 𝑦)
9 vex 3438 . . . . . 6 𝑦 ∈ V
109ideq 5790 . . . . 5 (𝑥 I 𝑦𝑥 = 𝑦)
11 df-br 5090 . . . . 5 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
128, 10, 113bitr2i 299 . . . 4 (𝑦 = 𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
13 opex 5402 . . . . . . 7 𝑥, 𝑦⟩ ∈ V
1413biantrur 530 . . . . . 6 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
15 eldif 3910 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1614, 15bitr4i 278 . . . . 5 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
17 df-br 5090 . . . . 5 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1816, 17xchnxbir 333 . . . 4 𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
1912, 18imbi12i 350 . . 3 ((𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
20192albii 1821 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
21 breq2 5093 . . . . 5 (𝑦 = 𝑥 → (𝑥𝑅𝑦𝑥𝑅𝑥))
2221notbid 318 . . . 4 (𝑦 = 𝑥 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑥))
2322equsalvw 2005 . . 3 (∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ¬ 𝑥𝑅𝑥)
2423albii 1820 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
257, 20, 243bitr2i 299 1 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1539   = wceq 1541  wcel 2110  Vcvv 3434  cdif 3897  cin 3899  wss 3900  c0 4281  cop 4580   class class class wbr 5089   I cid 5508  Rel wrel 5619
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2112  ax-9 2120  ax-ext 2702  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2067  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3394  df-v 3436  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4282  df-if 4474  df-sn 4575  df-pr 4577  df-op 4581  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621
This theorem is referenced by:  hartogslem1  9423  hausdiag  23553
  Copyright terms: Public domain W3C validator