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

Theorem bj-opelidb1ALT 38055
Description: Characterization of the couples in I. (Contributed by BJ, 29-Mar-2020.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
bj-opelidb1ALT (⟨𝐴, 𝐵⟩ ∈ I ↔ (𝐴 ∈ V ∧ 𝐴 = 𝐵))

Proof of Theorem bj-opelidb1ALT
StepHypRef Expression
1 df-br 5104 . . 3 (𝐴 I 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ I )
2 reli 5804 . . . 4 Rel I
32brrelex1i 5707 . . 3 (𝐴 I 𝐵 → 𝐴 ∈ V)
41, 3sylbir 238 . 2 (⟨𝐴, 𝐵⟩ ∈ I → 𝐴 ∈ V)
5 inex1g 5279 . . 3 (𝐴 ∈ V → (𝐴 ∩ 𝐵) ∈ V)
6 bj-opelid 38045 . . 3 ((𝐴 ∩ 𝐵) ∈ V → (⟨𝐴, 𝐵⟩ ∈ I ↔ 𝐴 = 𝐵))
75, 6syl 18 . 2 (𝐴 ∈ V → (⟨𝐴, 𝐵⟩ ∈ I ↔ 𝐴 = 𝐵))
84, 7biadanii 834 1 (⟨𝐴, 𝐵⟩ ∈ I ↔ (𝐴 ∈ V ∧ 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∩ cin 3898  ⟨cop 4590   class class class wbr 5103   I cid 5545
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391
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-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator