ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  intirr GIF version

Theorem intirr 4974
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 3300 . . . 4 (𝑅 ∩ I ) = ( I ∩ 𝑅)
21eqeq1i 2165 . . 3 ((𝑅 ∩ I ) = ∅ ↔ ( I ∩ 𝑅) = ∅)
3 disj2 3450 . . 3 (( I ∩ 𝑅) = ∅ ↔ I ⊆ (V ∖ 𝑅))
4 reli 4717 . . . 4 Rel I
5 ssrel 4676 . . . 4 (Rel I → ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))))
64, 5ax-mp 5 . . 3 ( I ⊆ (V ∖ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
72, 3, 63bitri 205 . 2 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
8 equcom 1686 . . . . 5 (𝑦 = 𝑥𝑥 = 𝑦)
9 vex 2715 . . . . . 6 𝑦 ∈ V
109ideq 4740 . . . . 5 (𝑥 I 𝑦𝑥 = 𝑦)
11 df-br 3968 . . . . 5 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
128, 10, 113bitr2i 207 . . . 4 (𝑦 = 𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
13 vex 2715 . . . . . . . 8 𝑥 ∈ V
1413, 9opex 4191 . . . . . . 7 𝑥, 𝑦⟩ ∈ V
1514biantrur 301 . . . . . 6 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
16 eldif 3111 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ V ∧ ¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1715, 16bitr4i 186 . . . . 5 (¬ ⟨𝑥, 𝑦⟩ ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
18 df-br 3968 . . . . 5 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1917, 18xchnxbir 671 . . . 4 𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅))
2012, 19imbi12i 238 . . 3 ((𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ (⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
21202albii 1451 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ I → ⟨𝑥, 𝑦⟩ ∈ (V ∖ 𝑅)))
22 nfv 1508 . . . 4 𝑦 ¬ 𝑥𝑅𝑥
23 breq2 3971 . . . . 5 (𝑦 = 𝑥 → (𝑥𝑅𝑦𝑥𝑅𝑥))
2423notbid 657 . . . 4 (𝑦 = 𝑥 → (¬ 𝑥𝑅𝑦 ↔ ¬ 𝑥𝑅𝑥))
2522, 24equsal 1707 . . 3 (∀𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ¬ 𝑥𝑅𝑥)
2625albii 1450 . 2 (∀𝑥𝑦(𝑦 = 𝑥 → ¬ 𝑥𝑅𝑦) ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
277, 21, 263bitr2i 207 1 ((𝑅 ∩ I ) = ∅ ↔ ∀𝑥 ¬ 𝑥𝑅𝑥)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 103  wb 104  wal 1333   = wceq 1335  wcel 2128  Vcvv 2712  cdif 3099  cin 3101  wss 3102  c0 3395  cop 3564   class class class wbr 3967   I cid 4250  Rel wrel 4593
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-14 2131  ax-ext 2139  ax-sep 4084  ax-pow 4137  ax-pr 4171
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ral 2440  df-rex 2441  df-v 2714  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3396  df-pw 3546  df-sn 3567  df-pr 3568  df-op 3570  df-br 3968  df-opab 4028  df-id 4255  df-xp 4594  df-rel 4595
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator