Theorem erref 6670

Description: An equivalence relation is reflexive on its field. Compare Theorem 3M of [Enderton] p. 56. (Contributed by Mario Carneiro, 6-May-2013.) (Revised by Mario Carneiro, 12-Aug-2015.)

Hypotheses

Ref	Expression
ersymb.1	⊢ (𝜑 → 𝑅 Er 𝑋)
erref.2	⊢ (𝜑 → 𝐴 ∈ 𝑋)

Assertion

Ref	Expression
erref	⊢ (𝜑 → 𝐴𝑅𝐴)

Proof of Theorem erref

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		erref.2	. . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑋)
2		ersymb.1	. . . . 5 ⊢ (𝜑 → 𝑅 Er 𝑋)
3		erdm 6660	. . . . 5 ⊢ (𝑅 Er 𝑋 → dom 𝑅 = 𝑋)
4	2, 3	syl 14	. . . 4 ⊢ (𝜑 → dom 𝑅 = 𝑋)
5	1, 4	eleqtrrd 2289	. . 3 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)
6		eldmg 4895	. . . 4 ⊢ (𝐴 ∈ 𝑋 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
7	1, 6	syl 14	. . 3 ⊢ (𝜑 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
8	5, 7	mpbid 147	. 2 ⊢ (𝜑 → ∃𝑥 𝐴𝑅𝑥)
9	2	adantr 276	. . 3 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝑅 Er 𝑋)
10		simpr 110	. . 3 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝐴𝑅𝑥)
11	9, 10, 10	ertr4d 6669	. 2 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝐴𝑅𝐴)
12	8, 11	exlimddv 1925	1 ⊢ (𝜑 → 𝐴𝑅𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1375  ∃wex 1518   ∈ wcel 2180   class class class wbr 4062  dom cdm 4696   Er wer 6647

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 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-14 2183  ax-ext 2191  ax-sep 4181  ax-pow 4237  ax-pr 4272

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-rex 2494  df-v 2781  df-un 3181  df-in 3183  df-ss 3190  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-br 4063  df-opab 4125  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-er 6650

This theorem is referenced by:  iserd  6676  erth  6696  iinerm  6724  erinxp  6726  qusgrp  13735