| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elres | Structured version Visualization version GIF version | ||
| Description: Membership in a restriction. (Contributed by Scott Fenton, 17-Mar-2011.) (Proof shortened by Peter Mazsa, 9-Sep-2022.) |
| Ref | Expression |
|---|---|
| elres | ⊢ (𝐴 ∈ (𝐵 ↾ 𝐶) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 5673 | . . 3 ⊢ (𝐵 ↾ 𝐶) = (𝐵 ∩ (𝐶 × V)) | |
| 2 | 1 | eleq2i 2855 | . 2 ⊢ (𝐴 ∈ (𝐵 ↾ 𝐶) ↔ 𝐴 ∈ (𝐵 ∩ (𝐶 × V))) |
| 3 | elinxp 6018 | . 2 ⊢ (𝐴 ∈ (𝐵 ∩ (𝐶 × V)) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ V (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
| 4 | rexv 3482 | . . 3 ⊢ (∃𝑦 ∈ V (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
| 5 | 4 | rexbii 3112 | . 2 ⊢ (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ V (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| 6 | 2, 3, 5 | 3bitri 300 | 1 ⊢ (𝐴 ∈ (𝐵 ↾ 𝐶) ↔ ∃𝑥 ∈ 𝐶 ∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1570 ∃wex 1809 ∈ wcel 2143 ∃wrex 3089 Vcvv 3455 ∩ cin 3904 〈cop 4595 × cxp 5659 ↾ cres 5663 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-sep 5257 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-br 5110 df-opab 5174 df-xp 5667 df-rel 5668 df-res 5673 |
| This theorem is referenced by: elsnres 6020 eldm3 36253 |
| Copyright terms: Public domain | W3C validator |