| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-ideqg1 | Structured version Visualization version GIF version | ||
| Description: For sets, the identity
relation is the same thing as equality.
(Contributed by NM, 30-Apr-2004.) (Proof shortened by Andrew Salmon,
27-Aug-2011.) Generalize to a disjunctive antecedent. (Revised by BJ,
24-Dec-2023.)
TODO: delete once bj-ideqg 37896 is in the main section. |
| Ref | Expression |
|---|---|
| bj-ideqg1 | ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq12 2779 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥 = 𝑦 ↔ 𝐴 = 𝐵)) | |
| 2 | df-id 5554 | . . 3 ⊢ I = {〈𝑥, 𝑦〉 ∣ 𝑥 = 𝑦} | |
| 3 | 1, 2 | bj-brab2a1 37888 | . 2 ⊢ (𝐴 I 𝐵 ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵)) |
| 4 | simpr 490 | . . 3 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵) | |
| 5 | elex 3474 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
| 6 | 5 | a1d 26 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐴 ∈ V)) |
| 7 | elex 3474 | . . . . . . 7 ⊢ (𝐵 ∈ 𝑊 → 𝐵 ∈ V) | |
| 8 | eleq1a 2857 | . . . . . . 7 ⊢ (𝐵 ∈ V → (𝐴 = 𝐵 → 𝐴 ∈ V)) | |
| 9 | 7, 8 | syl 18 | . . . . . 6 ⊢ (𝐵 ∈ 𝑊 → (𝐴 = 𝐵 → 𝐴 ∈ V)) |
| 10 | 6, 9 | jaoi 871 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 = 𝐵 → 𝐴 ∈ V)) |
| 11 | eleq1 2850 | . . . . . . 7 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ V ↔ 𝐵 ∈ V)) | |
| 12 | 5, 11 | syl5ibcom 248 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐵 ∈ V)) |
| 13 | 7 | a1d 26 | . . . . . 6 ⊢ (𝐵 ∈ 𝑊 → (𝐴 = 𝐵 → 𝐵 ∈ V)) |
| 14 | 12, 13 | jaoi 871 | . . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 = 𝐵 → 𝐵 ∈ V)) |
| 15 | 10, 14 | jcad 522 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 = 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))) |
| 16 | 15 | ancrd 561 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 = 𝐵 → ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵))) |
| 17 | 4, 16 | impbid2 229 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵) ↔ 𝐴 = 𝐵)) |
| 18 | 3, 17 | bitrid 286 | 1 ⊢ ((𝐴 ∈ 𝑉 ∨ 𝐵 ∈ 𝑊) → (𝐴 I 𝐵 ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 Vcvv 3453 class class class wbr 5107 I cid 5553 |
| 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-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |