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

Theorem intirr 6106
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 4154 . . . 4 (𝑅 ∩ I ) = ( I ∩ 𝑅)
21eqeq1i 2765 . . 3 ((𝑅 ∩ I ) = ∅ ↔ ( I ∩ 𝑅) = ∅)
3 disj2 4410 . . 3 (( I ∩ 𝑅) = ∅ ↔ I ⊆ (V ∖ 𝑅))
4 reli 5800 . . . 4 Rel I
5 ssrel 5755 . . . 4 (Rel I → ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))))
64, 5ax-mp 5 . . 3 ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
72, 3, 63bitri 300 . 2 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
8 equcom 2051 . . . . 5 (𝑦 = 𝑥 ↔ 𝑥 = 𝑦)
9 vex 3454 . . . . . 6 𝑦 ∈ V
109ideq 5826 . . . . 5 (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
11 df-br 5103 . . . . 5 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
128, 10, 113bitr2i 302 . . . 4 (𝑦 = 𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
13 opex 5431 . . . . . . 7 ⟨𝑥, 𝑦⟩ ∈ V
1413biantrur 540 . . . . . 6 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
15 eldif 3908 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1614, 15bitr4i 281 . . . . 5 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
17 df-br 5103 . . . . 5 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1816, 17xchnxbir 336 . . . 4 (¬ 𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
1912, 18imbi12i 353 . . 3 ((𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
20192albii 1853 . 2 (∀𝑥∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥∀𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
21 breq2 5106 . . . . 5 (𝑦 = 𝑥 → (𝑥𝑅𝑦 ↔ 𝑥𝑅𝑥))
2221notbid 321 . . . 4 (𝑦 = 𝑥 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑥))
2322equsalvw 2037 . . 3 (∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ¬ 𝑥𝑅𝑥)
2423albii 1852 . 2 (∀𝑥∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
257, 20, 243bitr2i 302 1 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  Vcvv 3450   ∖ cdif 3895   ∩ cin 3897   ⊆ wss 3898  ∅c0 4278  ⟨cop 4589   class class class wbr 5102   I cid 5541  Rel wrel 5652
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  ax-sep 5248  ax-pr 5390
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-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-id 5542  df-xp 5653  df-rel 5654
This theorem is used by:  hartogslem1  9514  hausdiag  23926
  Copyright terms: Public domain W3C validator