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

Theorem erth 8810
Description: Basic property of equivalence relations. Theorem 73 of [Suppes] p. 82. (Contributed by NM, 23-Jul-1995.) (Revised by Mario Carneiro, 6-Jul-2015.)
Hypotheses
Ref Expression
erth.1 (𝜑 → 𝑅 Er 𝑋)
erth.2 (𝜑 → 𝐴 ∈ 𝑋)
Assertion
Ref Expression
erth (𝜑 → (𝐴𝑅𝐵 ↔ [𝐴]𝑅 = [𝐵]𝑅))

Proof of Theorem erth
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 erth.1 . . . . . . . 8 (𝜑 → 𝑅 Er 𝑋)
21ersymb 8770 . . . . . . 7 (𝜑 → (𝐴𝑅𝐵 ↔ 𝐵𝑅𝐴))
32biimpa 482 . . . . . 6 ((𝜑 ∧ 𝐴𝑅𝐵) → 𝐵𝑅𝐴)
41ertr 8771 . . . . . . 7 (𝜑 → ((𝐵𝑅𝐴 ∧ 𝐴𝑅𝑥) → 𝐵𝑅𝑥))
54impl 461 . . . . . 6 (((𝜑 ∧ 𝐵𝑅𝐴) ∧ 𝐴𝑅𝑥) → 𝐵𝑅𝑥)
63, 5syldanl 614 . . . . 5 (((𝜑 ∧ 𝐴𝑅𝐵) ∧ 𝐴𝑅𝑥) → 𝐵𝑅𝑥)
71ertr 8771 . . . . . 6 (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝑥) → 𝐴𝑅𝑥))
87impl 461 . . . . 5 (((𝜑 ∧ 𝐴𝑅𝐵) ∧ 𝐵𝑅𝑥) → 𝐴𝑅𝑥)
96, 8impbida 813 . . . 4 ((𝜑 ∧ 𝐴𝑅𝐵) → (𝐴𝑅𝑥 ↔ 𝐵𝑅𝑥))
10 vex 3458 . . . . 5 𝑥 ∈ V
11 erth.2 . . . . . 6 (𝜑 → 𝐴 ∈ 𝑋)
1211adantr 486 . . . . 5 ((𝜑 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ 𝑋)
13 elecg 8800 . . . . 5 ((𝑥 ∈ V ∧ 𝐴 ∈ 𝑋) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
1410, 12, 13sylancr 599 . . . 4 ((𝜑 ∧ 𝐴𝑅𝐵) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝑥))
15 errel 8765 . . . . . . 7 (𝑅 Er 𝑋 → Rel 𝑅)
161, 15syl 18 . . . . . 6 (𝜑 → Rel 𝑅)
17 brrelex2 5712 . . . . . 6 ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐵 ∈ V)
1816, 17sylan 592 . . . . 5 ((𝜑 ∧ 𝐴𝑅𝐵) → 𝐵 ∈ V)
19 elecg 8800 . . . . 5 ((𝑥 ∈ V ∧ 𝐵 ∈ V) → (𝑥 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝑥))
2010, 18, 19sylancr 599 . . . 4 ((𝜑 ∧ 𝐴𝑅𝐵) → (𝑥 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝑥))
219, 14, 203bitr4d 314 . . 3 ((𝜑 ∧ 𝐴𝑅𝐵) → (𝑥 ∈ [𝐴]𝑅 ↔ 𝑥 ∈ [𝐵]𝑅))
2221eqrdv 2761 . 2 ((𝜑 ∧ 𝐴𝑅𝐵) → [𝐴]𝑅 = [𝐵]𝑅)
231adantr 486 . . 3 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝑅 Er 𝑋)
241, 11erref 8776 . . . . . . 7 (𝜑 → 𝐴𝑅𝐴)
2524adantr 486 . . . . . 6 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐴𝑅𝐴)
2611adantr 486 . . . . . . 7 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐴 ∈ 𝑋)
27 elecg 8800 . . . . . . 7 ((𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴))
2826, 26, 27syl2anc 596 . . . . . 6 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → (𝐴 ∈ [𝐴]𝑅 ↔ 𝐴𝑅𝐴))
2925, 28mpbird 260 . . . . 5 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐴 ∈ [𝐴]𝑅)
30 simpr 490 . . . . 5 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → [𝐴]𝑅 = [𝐵]𝑅)
3129, 30eleqtrd 2866 . . . 4 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐴 ∈ [𝐵]𝑅)
3223, 30ereldm 8809 . . . . . 6 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → (𝐴 ∈ 𝑋 ↔ 𝐵 ∈ 𝑋))
3326, 32mpbid 235 . . . . 5 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐵 ∈ 𝑋)
34 elecg 8800 . . . . 5 ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴))
3526, 33, 34syl2anc 596 . . . 4 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → (𝐴 ∈ [𝐵]𝑅 ↔ 𝐵𝑅𝐴))
3631, 35mpbid 235 . . 3 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐵𝑅𝐴)
3723, 36ersym 8768 . 2 ((𝜑 ∧ [𝐴]𝑅 = [𝐵]𝑅) → 𝐴𝑅𝐵)
3822, 37impbida 813 1 (𝜑 → (𝐴𝑅𝐵 ↔ [𝐴]𝑅 = [𝐵]𝑅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   class class class wbr 5108  Rel wrel 5663   Er wer 8752  [cec 8753
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 5255  ax-pr 5398
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-ne 2960  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 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-er 8755  df-ec 8757
This theorem is used by:  erth2  8811  erthi  8812  qliftfun  8861  eroveu  8871  eceqoveq  8881  enreceq  11190  prsrlem1  11196  ercpbllem  17770  eqg0el  19448  orbsta  19578  sylow2blem3  19887  qusecsub  20100  frgpnabllem2  20139  rngqipring1  21663  qsnzr  21690  zndvds  21910  qustgpopn  24494  qustgphaus  24497  pi1xfrf  25429  pi1cof  25435  tgjustr  28993  erld2  33926  rlocf1  33934  fracfld  33974  qusvscpbl  34016  nsgqusf1olem3  34070  zringfrac  34189  pstmxmet  34640  sconnpi1  36212  topfneec2  37359
  Copyright terms: Public domain W3C validator