Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-ideqg Structured version   Visualization version   GIF version

Theorem bj-ideqg 37123
Description: Characterization of the classes related by the identity relation when their intersection is a set. Note that the antecedent is more general than either class being a set. (Contributed by NM, 30-Apr-2004.) Weaken the antecedent to sethood of the intersection. (Revised by BJ, 24-Dec-2023.)

TODO: replace ideqg 5876, or at least prove ideqg 5876 from it.

Assertion
Ref Expression
bj-ideqg ((𝐴𝐵) ∈ 𝑉 → (𝐴 I 𝐵𝐴 = 𝐵))

Proof of Theorem bj-ideqg
StepHypRef Expression
1 df-br 5167 . 2 (𝐴 I 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ I )
2 bj-opelid 37122 . 2 ((𝐴𝐵) ∈ 𝑉 → (⟨𝐴, 𝐵⟩ ∈ I ↔ 𝐴 = 𝐵))
31, 2bitrid 283 1 ((𝐴𝐵) ∈ 𝑉 → (𝐴 I 𝐵𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1537  wcel 2108  cin 3975  cop 4654   class class class wbr 5166   I cid 5592
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-id 5593
This theorem is referenced by:  bj-ideqb  37125
  Copyright terms: Public domain W3C validator