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

Theorem iserd 8772
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 2764 . . 3 (𝜑 → dom 𝑅 = dom 𝑅)
3 iserd.2 . . . . . . . 8 ((𝜑 ∧ 𝑥𝑅𝑦) → 𝑦𝑅𝑥)
43ex 418 . . . . . . 7 (𝜑 → (𝑥𝑅𝑦 → 𝑦𝑅𝑥))
5 iserd.3 . . . . . . . 8 ((𝜑 ∧ (𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧)) → 𝑥𝑅𝑧)
65ex 418 . . . . . . 7 (𝜑 → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
74, 6jca 521 . . . . . 6 (𝜑 → ((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
87alrimiv 1962 . . . . 5 (𝜑 → ∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
98alrimiv 1962 . . . 4 (𝜑 → ∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
109alrimiv 1962 . . 3 (𝜑 → ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 → 𝑦𝑅𝑥) ∧ ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧)))
11 dfer2 8746 . . 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 8766 . . . . . . 7 ((𝜑 ∧ 𝑥 ∈ dom 𝑅) → 𝑥𝑅𝑥)
1615ex 418 . . . . . 6 (𝜑 → (𝑥 ∈ dom 𝑅 → 𝑥𝑅𝑥))
17 vex 3458 . . . . . . 7 𝑥 ∈ V
1817, 17breldm 5897 . . . . . 6 (𝑥𝑅𝑥 → 𝑥 ∈ dom 𝑅)
1916, 18impbid1 228 . . . . 5 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥𝑅𝑥))
20 iserd.4 . . . . 5 (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥𝑅𝑥))
2119, 20bitr4d 285 . . . 4 (𝜑 → (𝑥 ∈ dom 𝑅 ↔ 𝑥 ∈ 𝐴))
2221eqrdv 2761 . . 3 (𝜑 → dom 𝑅 = 𝐴)
23 ereq2 8754 . . 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 2147   class class class wbr 5106  dom cdm 5655  Rel wrel 5660   Er wer 8742
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-er 8745
This theorem is used by:  iseri  8773  iseriALT  8774  swoer  8777  iiner  8838  erinxp  8840  cicer  18010  eqger  19419  gaorber  19552  efgrelexlemb  19994  efgcpbllemb  19999  xmeter  24782  ercgrg  29010  cgraer  29407  erler  33896  metider  34596  prjsper  43829  cicerALT  50365
  Copyright terms: Public domain W3C validator