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

Theorem bj-ideqg1ALT 38180
Description: Alternate proof of bj-ideqg1 using brabga 5507 instead of the "unbounded" version bj-brab2a1 38164 or brab2a 5743. (Contributed by BJ, 25-Dec-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

TODO: delete once bj-ideqg 38172 is in the main section.

Assertion
Ref Expression
bj-ideqg1ALT ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))

Proof of Theorem bj-ideqg1ALT
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reli 5803 . . . 4 Rel I
21brrelex12i 5705 . . 3 (𝐴 I 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
32adantl 487 . 2 (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 I 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
4 elex 3471 . . . . 5 (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
54adantr 486 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
6 eleq1 2848 . . . . . 6 (𝐴 = 𝐵 → (𝐴 ∈ 𝑊 ↔ 𝐵 ∈ 𝑊))
76biimparc 485 . . . . 5 ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑊)
87elexd 3473 . . . 4 ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
95, 8jaoian 971 . . 3 (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
10 eleq1 2848 . . . . . 6 (𝐴 = 𝐵 → (𝐴 ∈ 𝑉 ↔ 𝐵 ∈ 𝑉))
1110biimpac 484 . . . . 5 ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑉)
1211elexd 3473 . . . 4 ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
13 elex 3471 . . . . 5 (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
1413adantr 486 . . . 4 ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
1512, 14jaoian 971 . . 3 (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
169, 15jca 521 . 2 (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
17 eqeq12 2777 . . 3 ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = 𝑦 ↔ 𝐴 = 𝐵))
18 df-id 5545 . . 3 I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
1917, 18brabga 5507 . 2 ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))
203, 16, 19pm5.21nd 814 1 ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  Vcvv 3450   class class class wbr 5102   I cid 5544
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator