ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  breq GIF version

Theorem breq 4046
Description: Equality theorem for binary relations. (Contributed by NM, 4-Jun-1995.)
Assertion
Ref Expression
breq (𝑅 = 𝑆 → (𝐴𝑅𝐵𝐴𝑆𝐵))

Proof of Theorem breq
StepHypRef Expression
1 eleq2 2269 . 2 (𝑅 = 𝑆 → (⟨𝐴, 𝐵⟩ ∈ 𝑅 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆))
2 df-br 4045 . 2 (𝐴𝑅𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑅)
3 df-br 4045 . 2 (𝐴𝑆𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ 𝑆)
41, 2, 33bitr4g 223 1 (𝑅 = 𝑆 → (𝐴𝑅𝐵𝐴𝑆𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1373  wcel 2176  cop 3636   class class class wbr 4044
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-5 1470  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-4 1533  ax-17 1549  ax-ial 1557  ax-ext 2187
This theorem depends on definitions:  df-bi 117  df-cleq 2198  df-clel 2201  df-br 4045
This theorem is referenced by:  breqi  4050  breqd  4055  poeq1  4346  soeq1  4362  frforeq1  4390  weeq1  4403  fveq1  5575  foeqcnvco  5859  f1eqcocnv  5860  isoeq2  5871  isoeq3  5872  ofreq  6162  supeq3  7092  tapeq1  7364  shftfvalg  11129  shftfval  11132  pw1nct  15940
  Copyright terms: Public domain W3C validator