Theorem erref 6569

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 6559	. . . . 5 ⊢ (𝑅 Er 𝑋 → dom 𝑅 = 𝑋)
4	2, 3	syl 14	. . . 4 ⊢ (𝜑 → dom 𝑅 = 𝑋)
5	1, 4	eleqtrrd 2267	. . 3 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)
6		eldmg 4834	. . . 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 6568	. 2 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝐴𝑅𝐴)
12	8, 11	exlimddv 1908	1 ⊢ (𝜑 → 𝐴𝑅𝐴)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1363  ∃wex 1502   ∈ wcel 2158   class class class wbr 4015  dom cdm 4638   Er wer 6546

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 710  ax-5 1457  ax-7 1458  ax-gen 1459  ax-ie1 1503  ax-ie2 1504  ax-8 1514  ax-10 1515  ax-11 1516  ax-i12 1517  ax-bndl 1519  ax-4 1520  ax-17 1536  ax-i9 1540  ax-ial 1544  ax-i5r 1545  ax-14 2161  ax-ext 2169  ax-sep 4133  ax-pow 4186  ax-pr 4221

This theorem depends on definitions:  df-bi 117  df-3an 981  df-tru 1366  df-nf 1471  df-sb 1773  df-eu 2039  df-mo 2040  df-clab 2174  df-cleq 2180  df-clel 2183  df-nfc 2318  df-ral 2470  df-rex 2471  df-v 2751  df-un 3145  df-in 3147  df-ss 3154  df-pw 3589  df-sn 3610  df-pr 3611  df-op 3613  df-br 4016  df-opab 4077  df-xp 4644  df-rel 4645  df-cnv 4646  df-co 4647  df-dm 4648  df-er 6549

This theorem is referenced by:  iserd  6575  erth  6593  iinerm  6621  erinxp  6623