Theorem erref 6126

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 6116	. . . . 5 ⊢ (𝑅 Er 𝑋 → dom 𝑅 = 𝑋)
4	2, 3	syl 14	. . . 4 ⊢ (𝜑 → dom 𝑅 = 𝑋)
5	1, 4	eleqtrrd 2117	. . 3 ⊢ (𝜑 → 𝐴 ∈ dom 𝑅)
6		eldmg 4530	. . . 4 ⊢ (𝐴 ∈ 𝑋 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
7	1, 6	syl 14	. . 3 ⊢ (𝜑 → (𝐴 ∈ dom 𝑅 ↔ ∃𝑥 𝐴𝑅𝑥))
8	5, 7	mpbid 135	. 2 ⊢ (𝜑 → ∃𝑥 𝐴𝑅𝑥)
9	2	adantr 261	. . 3 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝑅 Er 𝑋)
10		simpr 103	. . 3 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝐴𝑅𝑥)
11	9, 10, 10	ertr4d 6125	. 2 ⊢ ((𝜑 ∧ 𝐴𝑅𝑥) → 𝐴𝑅𝐴)
12	8, 11	exlimddv 1778	1 ⊢ (𝜑 → 𝐴𝑅𝐴)

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243  ∃wex 1381   ∈ wcel 1393   class class class wbr 3764  dom cdm 4345   Er wer 6103

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-br 3765  df-opab 3819  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-er 6106

This theorem is referenced by:  iserd  6132  erth  6150  iinerm  6178  erinxp  6180