| Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-opelidres | Structured version Visualization version GIF version | ||
| Description: Characterization of the ordered pairs in the restricted identity relation when the intersection of their component belongs to the restricting class. TODO: prove bj-idreseq 37338 from it. (Contributed by BJ, 29-Mar-2020.) |
| Ref | Expression |
|---|---|
| bj-opelidres | ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐵〉 ∈ ( I ↾ 𝑉) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bj-idres 37336 | . . 3 ⊢ ( I ↾ 𝑉) = ( I ∩ (𝑉 × 𝑉)) | |
| 2 | 1 | eleq2i 2829 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ( I ↾ 𝑉) ↔ 〈𝐴, 𝐵〉 ∈ ( I ∩ (𝑉 × 𝑉))) |
| 3 | elin 3918 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ ( I ∩ (𝑉 × 𝑉)) ↔ (〈𝐴, 𝐵〉 ∈ I ∧ 〈𝐴, 𝐵〉 ∈ (𝑉 × 𝑉))) | |
| 4 | inex1g 5265 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∩ 𝐵) ∈ V) | |
| 5 | bj-opelid 37332 | . . . . . 6 ⊢ ((𝐴 ∩ 𝐵) ∈ V → (〈𝐴, 𝐵〉 ∈ I ↔ 𝐴 = 𝐵)) | |
| 6 | 4, 5 | syl 17 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐵〉 ∈ I ↔ 𝐴 = 𝐵)) |
| 7 | opelxp 5661 | . . . . . 6 ⊢ (〈𝐴, 𝐵〉 ∈ (𝑉 × 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) | |
| 8 | 7 | a1i 11 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐵〉 ∈ (𝑉 × 𝑉) ↔ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉))) |
| 9 | 6, 8 | anbi12d 633 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ((〈𝐴, 𝐵〉 ∈ I ∧ 〈𝐴, 𝐵〉 ∈ (𝑉 × 𝑉)) ↔ (𝐴 = 𝐵 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)))) |
| 10 | simpl 482 | . . . . 5 ⊢ ((𝐴 = 𝐵 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) → 𝐴 = 𝐵) | |
| 11 | eleq1 2825 | . . . . . . . 8 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ 𝑉 ↔ 𝐵 ∈ 𝑉)) | |
| 12 | 11 | biimpcd 249 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐵 ∈ 𝑉)) |
| 13 | 12 | anc2li 555 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉))) |
| 14 | 13 | ancld 550 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 = 𝐵 → (𝐴 = 𝐵 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)))) |
| 15 | 10, 14 | impbid2 226 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ((𝐴 = 𝐵 ∧ (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑉)) ↔ 𝐴 = 𝐵)) |
| 16 | 9, 15 | bitrd 279 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((〈𝐴, 𝐵〉 ∈ I ∧ 〈𝐴, 𝐵〉 ∈ (𝑉 × 𝑉)) ↔ 𝐴 = 𝐵)) |
| 17 | 3, 16 | bitrid 283 | . 2 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐵〉 ∈ ( I ∩ (𝑉 × 𝑉)) ↔ 𝐴 = 𝐵)) |
| 18 | 2, 17 | bitrid 283 | 1 ⊢ (𝐴 ∈ 𝑉 → (〈𝐴, 𝐵〉 ∈ ( I ↾ 𝑉) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3441 ∩ cin 3901 〈cop 4587 I cid 5519 × cxp 5623 ↾ cres 5627 |
| 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-ral 3053 df-rex 3062 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-opab 5162 df-id 5520 df-xp 5631 df-rel 5632 df-res 5637 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |