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

Theorem asymref 5147
Description: Two ways of saying a relation is antisymmetric and reflexive. 𝑅 is the field of a relation by relfld 5290. (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 4109 . . . . . . . . . . 11 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
2 vex 2815 . . . . . . . . . . . 12 𝑥 ∈ V
3 vex 2815 . . . . . . . . . . . 12 𝑦 ∈ V
42, 3opeluu 4570 . . . . . . . . . . 11 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → (𝑥 𝑅𝑦 𝑅))
51, 4sylbi 121 . . . . . . . . . 10 (𝑥𝑅𝑦 → (𝑥 𝑅𝑦 𝑅))
65simpld 112 . . . . . . . . 9 (𝑥𝑅𝑦𝑥 𝑅)
76adantr 276 . . . . . . . 8 ((𝑥𝑅𝑦𝑦𝑅𝑥) → 𝑥 𝑅)
87pm4.71ri 392 . . . . . . 7 ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)))
98bibi1i 228 . . . . . 6 (((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅𝑥 = 𝑦)) ↔ ((𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ (𝑥 𝑅𝑥 = 𝑦)))
10 elin 3401 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
112, 3brcnv 4937 . . . . . . . . . 10 (𝑥𝑅𝑦𝑦𝑅𝑥)
12 df-br 4109 . . . . . . . . . 10 (𝑥𝑅𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
1311, 12bitr3i 186 . . . . . . . . 9 (𝑦𝑅𝑥 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅)
141, 13anbi12i 460 . . . . . . . 8 ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
1510, 14bitr4i 187 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ (𝑥𝑅𝑦𝑦𝑅𝑥))
163opelres 5042 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅) ↔ (⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 𝑅))
17 df-br 4109 . . . . . . . . . 10 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
183ideq 4906 . . . . . . . . . 10 (𝑥 I 𝑦𝑥 = 𝑦)
1917, 18bitr3i 186 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑥 = 𝑦)
2019anbi2ci 459 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ I ∧ 𝑥 𝑅) ↔ (𝑥 𝑅𝑥 = 𝑦))
2116, 20bitri 184 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅) ↔ (𝑥 𝑅𝑥 = 𝑦))
2215, 21bibi12i 229 . . . . . 6 ((⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ (𝑥 𝑅𝑥 = 𝑦)))
23 pm5.32 453 . . . . . 6 ((𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)) ↔ ((𝑥 𝑅 ∧ (𝑥𝑅𝑦𝑦𝑅𝑥)) ↔ (𝑥 𝑅𝑥 = 𝑦)))
249, 22, 233bitr4i 212 . . . . 5 ((⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ (𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2524albii 1519 . . . 4 (∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ∀𝑦(𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
26 19.21v 1922 . . . 4 (∀𝑦(𝑥 𝑅 → ((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)) ↔ (𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2725, 26bitri 184 . . 3 (∀𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ (𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
2827albii 1519 . 2 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)) ↔ ∀𝑥(𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
29 relcnv 5139 . . . 4 Rel 𝑅
30 relin2 4870 . . . 4 (Rel 𝑅 → Rel (𝑅𝑅))
3129, 30ax-mp 5 . . 3 Rel (𝑅𝑅)
32 relres 5065 . . 3 Rel ( I ↾ 𝑅)
33 eqrel 4838 . . 3 ((Rel (𝑅𝑅) ∧ Rel ( I ↾ 𝑅)) → ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅))))
3431, 32, 33mp2an 426 . 2 ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ (𝑅𝑅) ↔ ⟨𝑥, 𝑦⟩ ∈ ( I ↾ 𝑅)))
35 df-ral 2525 . 2 (∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 𝑅 → ∀𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦)))
3628, 34, 353bitr4i 212 1 ((𝑅𝑅) = ( I ↾ 𝑅) ↔ ∀𝑥 𝑅𝑦((𝑥𝑅𝑦𝑦𝑅𝑥) ↔ 𝑥 = 𝑦))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1396   = wceq 1398  wcel 2203  wral 2520  cin 3209  cop 3691   cuni 3913   class class class wbr 4108   I cid 4408  ccnv 4747  cres 4750  Rel wrel 4753
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-br 4109  df-opab 4171  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-res 4760
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator