Theorem bj-ideqg1ALT 34460

Description: Alternate proof of bj-ideqg1 using brabga 5421 instead of the "unbounded" version bj-brab2a1 34444 or brab2a 5644. (Contributed by BJ, 25-Dec-2023.) (Proof modification is discouraged.) (New usage is discouraged.)

TODO: delete once bj-ideqg 34452 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.

Step	Hyp	Ref	Expression
1		reli 5698	. . . 4 ⊢ Rel I
2	1	brrelex12i 5607	. . 3 ⊢ (𝐴 I 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
3	2	adantl 484	. 2 ⊢ (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 I 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
4		elex 3512	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
5	4	adantr 483	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
6		eleq1 2900	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝑊 ↔ 𝐵 ∈ 𝑊))
7	6	biimparc 482	. . . . 5 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐴 ∈ 𝑊)
8	7	elexd 3514	. . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
9	5, 8	jaoian 953	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → 𝐴 ∈ V)
10		eleq1 2900	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝑉 ↔ 𝐵 ∈ 𝑉))
11	10	biimpac 481	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐵 ∈ 𝑉)
12	11	elexd 3514	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
13		elex 3512	. . . . 5 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V)
14	13	adantr 483	. . . 4 ⊢ ((𝐵 ∈ 𝑊 ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
15	12, 14	jaoian 953	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
16	9, 15	jca 514	. 2 ⊢ (((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) ∧ 𝐴 = 𝐵) → (𝐴 ∈ V ∧ 𝐵 ∈ V))
17		eqeq12 2835	. . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = 𝑦 ↔ 𝐴 = 𝐵))
18		df-id 5460	. . 3 ⊢ I = {⟨𝑥, 𝑦⟩ ∣ 𝑥 = 𝑦}
19	17, 18	brabga 5421	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))
20	3, 16, 19	pm5.21nd 800	1 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   = wceq 1537   ∈ wcel 2114  Vcvv 3494   class class class wbr 5066   I cid 5459

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pr 5330

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-br 5067  df-opab 5129  df-id 5460  df-xp 5561  df-rel 5562

This theorem is referenced by: (None)