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

Theorem iserd 8722
Description: A reflexive, symmetric, transitive relation is an equivalence relation on its domain. (Contributed by Mario Carneiro, 9-Jul-2014.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
iserd.1 (𝜑 → Rel 𝑅)
iserd.2 ((𝜑 ∧ 𝑥𝑅𝑦) → 𝑦𝑅𝑥)
iserd.3 ((𝜑 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)) → 𝑥𝑅𝑧)
iserd.4 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥𝑅𝑥))
Assertion
Ref Expression
iserd (𝜑 → 𝑅 Er 𝐴)
Distinct variable groups:   𝑥,𝑦,𝑧,𝑅   𝑥,𝐴   𝜑,𝑥,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑦, 𝑧)

Proof of Theorem iserd
StepHypRef Expression
1 iserd.1 . . 3 (𝜑 → Rel 𝑅)
2 eqidd 2761 . . 3 (𝜑 → dom 𝑅 = dom 𝑅)
3 iserd.2 . . . . . . . 8 ((𝜑 ∧ 𝑥𝑅𝑦) → 𝑦𝑅𝑥)
43ex 418 . . . . . . 7 (𝜑 → (𝑥𝑅𝑦 → 𝑦𝑅𝑥))
5 iserd.3 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)) → 𝑥𝑅𝑧)
65ex 418 . . . . . . 7 (𝜑 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
74, 6jca 521 . . . . . 6 (𝜑 → ((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
87alrimiv 1960 . . . . 5 (𝜑 → ∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
98alrimiv 1960 . . . 4 (𝜑 → ∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
109alrimiv 1960 . . 3 (𝜑 → ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
11 dfer2 8696 . . 3 (𝑅 Er dom 𝑅 ↔ (Rel 𝑅 ∧ dom 𝑅 = dom 𝑅 ∧ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))))
121, 2, 10, 11syl3anbrc 1362 . 2 (𝜑 → 𝑅 Er dom 𝑅)
1312adantr 486 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom 𝑅) → 𝑅 Er dom 𝑅)
14 simpr 490 . . . . . . . 8 ((𝜑 ∧ 𝑥 ∈ dom 𝑅) → 𝑥 ∈ dom 𝑅)
1513, 14erref 8716 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom 𝑅) → 𝑥𝑅𝑥)
1615ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ dom 𝑅 → 𝑥𝑅𝑥))
17 vex 3454 . . . . . . 7 𝑥 ∈ V
1817, 17breldm 5886 . . . . . 6 (𝑥𝑅𝑥 → 𝑥 ∈ dom 𝑅)
1916, 18impbid1 228 . . . . 5 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥𝑅𝑥))
20 iserd.4 . . . . 5 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥𝑅𝑥))
2119, 20bitr4d 285 . . . 4 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ 𝐴))
2221eqrdv 2758 . . 3 (𝜑 → dom 𝑅 = 𝐴)
23 ereq2 8704 . . 3 (dom 𝑅 = 𝐴 → (𝑅 Er dom 𝑅 ↔ 𝑅 Er 𝐴))
2422, 23syl 18 . 2 (𝜑 → (𝑅 Er dom 𝑅 ↔ 𝑅 Er 𝐴))
2512, 24mpbid 235 1 (𝜑 → 𝑅 Er 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145   class class class wbr 5102  dom cdm 5647  Rel wrel 5652   Er wer 8692
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-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-er 8695
This theorem is used by:  iseri  8723  iseriALT  8724  swoer  8727  iiner  8788  erinxp  8790  cicer  17943  eqger  19352  gaorber  19484  efgrelexlemb  19926  efgcpbllemb  19931  xmeter  24714  ercgrg  28914  cgraer  29311  erler  33760  metider  34460  prjsper  43558  cicerALT  50076
  Copyright terms: Public domain W3C validator