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

Theorem iserd 8745
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 1959 . . . . 5 (𝜑 → ∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
98alrimiv 1959 . . . 4 (𝜑 → ∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
109alrimiv 1959 . . 3 (𝜑 → ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
11 dfer2 8719 . . 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 8739 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom 𝑅) → 𝑥𝑅𝑥)
1615ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ dom 𝑅 → 𝑥𝑅𝑥))
17 vex 3454 . . . . . . 7 𝑥 ∈ V
1817, 17breldm 5889 . . . . . 6 (𝑥𝑅𝑥 → 𝑥 ∈ dom 𝑅)
1916, 18impbid1 228 . . . . 5 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥𝑅𝑥))
20 iserd.4 . . . . 5 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥𝑅𝑥))
2119, 20bitr4d 285 . . . 4 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ 𝐴))
2221eqrdv 2758 . . 3 (𝜑 → dom 𝑅 = 𝐴)
23 ereq2 8727 . . 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 1567   = wceq 1569   ∈ wcel 2144   class class class wbr 5102  dom cdm 5650  Rel wrel 5655   Er wer 8715
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  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 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-er 8718
This theorem is used by:  iseri  8746  iseriALT  8747  swoer  8750  iiner  8811  erinxp  8813  cicer  17982  eqger  19391  gaorber  19523  efgrelexlemb  19965  efgcpbllemb  19970  xmeter  24753  ercgrg  28981  cgraer  29378  erler  33869  metider  34569  prjsper  43712  cicerALT  50230
  Copyright terms: Public domain W3C validator