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

Theorem asymref 4924
Description: Two ways of saying a relation is antisymmetric and reflexive. 𝑅 is the field of a relation by relfld 5067. (Contributed by NM, 6-May-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
asymref ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦))
Distinct variable group:   𝑥,𝑦,𝑅

Proof of Theorem asymref
StepHypRef Expression
1 df-br 3930 . . . . . . . . . . 11 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
2 vex 2689 . . . . . . . . . . . 12 𝑥 ∈ V
3 vex 2689 . . . . . . . . . . . 12 𝑦 ∈ V
42, 3opeluu 4371 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → (𝑥 𝑅𝑦 𝑅))
51, 4sylbi 120 . . . . . . . . . 10 (𝑥𝑅𝑦 → (𝑥 𝑅𝑦 𝑅))
65simpld 111 . . . . . . . . 9 (𝑥𝑅𝑦𝑥 𝑅)
76adantr 274 . . . . . . . 8 ((𝑥𝑅𝑦𝑦𝑅𝑥) → 𝑥 𝑅)
87pm4.71ri 389 . . . . . . 7 ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)))
98bibi1i 227 . . . . . 6 (((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅𝑥 = 𝑦)) ↔ ((𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ (𝑥 𝑅𝑥 = 𝑦)))
10 elin 3259 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
112, 3brcnv 4722 . . . . . . . . . 10 (𝑥𝑅𝑦𝑦𝑅𝑥)
12 df-br 3930 . . . . . . . . . 10 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1311, 12bitr3i 185 . . . . . . . . 9 (𝑦𝑅𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
141, 13anbi12i 455 . . . . . . . 8 ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1510, 14bitr4i 186 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
163opelres 4824 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 𝑅))
17 df-br 3930 . . . . . . . . . 10 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
183ideq 4691 . . . . . . . . . 10 (𝑥 I 𝑦𝑥 = 𝑦)
1917, 18bitr3i 185 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
2019anbi2ci 454 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 𝑅) ↔ (𝑥 𝑅𝑥 = 𝑦))
2116, 20bitri 183 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅) ↔ (𝑥 𝑅𝑥 = 𝑦))
2215, 21bibi12i 228 . . . . . 6 ((⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅𝑥 = 𝑦)))
23 pm5.32 448 . . . . . 6 ((𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)) ↔ ((𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ (𝑥 𝑅𝑥 = 𝑦)))
249, 22, 233bitr4i 211 . . . . 5 ((⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ (𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2524albii 1446 . . . 4 (∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ∀𝑦(𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
26 19.21v 1845 . . . 4 (∀𝑦(𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)) ↔ (𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2725, 26bitri 183 . . 3 (∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ (𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2827albii 1446 . 2 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ∀𝑥(𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
29 relcnv 4917 . . . 4 Rel 𝑅
30 relin2 4658 . . . 4 (Rel 𝑅 → Rel (𝑅𝑅))
3129, 30ax-mp 5 . . 3 Rel (𝑅𝑅)
32 relres 4847 . . 3 Rel ( I ↾ 𝑅)
33 eqrel 4628 . . 3 ((Rel (𝑅𝑅) ∧ Rel ( I ↾ 𝑅)) → ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅))))
3431, 32, 33mp2an 422 . 2 ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)))
35 df-ral 2421 . 2 (∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
3628, 34, 353bitr4i 211 1 ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  wal 1329   = wceq 1331  wcel 1480  wral 2416  cin 3070  cop 3530   cuni 3736   class class class wbr 3929   I cid 4210  ccnv 4538  cres 4541  Rel wrel 4544
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-res 4551
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator