| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opelres | Structured version Visualization version GIF version | ||
| Description: Ordered pair elementhood in a restriction. Exercise 13 of [TakeutiZaring] p. 25. (Contributed by NM, 13-Nov-1995.) (Revised by BJ, 18-Feb-2022.) Commute the consequent. (Revised by Peter Mazsa, 24-Sep-2022.) |
| Ref | Expression |
|---|---|
| opelres | ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 5637 | . . 3 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × V)) | |
| 2 | 1 | elin2 4144 | . 2 ⊢ (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V))) |
| 3 | opelxp 5661 | . . . 4 ⊢ (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V)) | |
| 4 | elex 3451 | . . . . 5 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 5 | 4 | biantrud 531 | . . . 4 ⊢ (𝐶 ∈ 𝑉 → (𝐵 ∈ 𝐴 ↔ (𝐵 ∈ 𝐴 ∧ 𝐶 ∈ V))) |
| 6 | 3, 5 | bitr4id 290 | . . 3 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝐴 × V) ↔ 𝐵 ∈ 𝐴)) |
| 7 | 6 | anbi1cd 636 | . 2 ⊢ (𝐶 ∈ 𝑉 → ((〈𝐵, 𝐶〉 ∈ 𝑅 ∧ 〈𝐵, 𝐶〉 ∈ (𝐴 × V)) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| 8 | 2, 7 | bitrid 283 | 1 ⊢ (𝐶 ∈ 𝑉 → (〈𝐵, 𝐶〉 ∈ (𝑅 ↾ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 〈𝐵, 𝐶〉 ∈ 𝑅))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∈ wcel 2114 Vcvv 3430 〈cop 4574 × 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-ext 2709 ax-sep 5232 ax-pr 5371 |
| 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-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-opab 5149 df-xp 5631 df-res 5637 |
| This theorem is referenced by: brres 5946 opelresi 5947 opelidres 5951 h2hlm 31069 setsnidel 47852 |
| Copyright terms: Public domain | W3C validator |