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 37333
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 5801, or at least prove ideqg 5801 from it.

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

Proof of Theorem bj-ideqg
StepHypRef Expression
1 df-br 5100 . 2 (𝐴 I 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ I )
2 bj-opelid 37332 . 2 ((𝐴𝐵) ∈ 𝑉 → (⟨𝐴, 𝐵⟩ ∈ I ↔ 𝐴 = 𝐵))
31, 2bitrid 283 1 ((𝐴𝐵) ∈ 𝑉 → (𝐴 I 𝐵𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  cin 3901  cop 4587   class class class wbr 5099   I cid 5519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5242  ax-nul 5252  ax-pr 5378
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3401  df-v 3443  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4287  df-if 4481  df-sn 4582  df-pr 4584  df-op 4588  df-br 5100  df-opab 5162  df-id 5520
This theorem is referenced by:  bj-ideqb  37335
  Copyright terms: Public domain W3C validator