Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > elsnres | GIF version |
Description: Memebership in restriction to a singleton. (Contributed by Scott Fenton, 17-Mar-2011.) |
Ref | Expression |
---|---|
elsnres.1 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
elsnres | ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elres 4925 | . 2 ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑥 ∈ {𝐶}∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
2 | rexcom4 2753 | . 2 ⊢ (∃𝑥 ∈ {𝐶}∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑦∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵)) | |
3 | elsnres.1 | . . . 4 ⊢ 𝐶 ∈ V | |
4 | opeq1 3763 | . . . . . 6 ⊢ (𝑥 = 𝐶 → 〈𝑥, 𝑦〉 = 〈𝐶, 𝑦〉) | |
5 | 4 | eqeq2d 2182 | . . . . 5 ⊢ (𝑥 = 𝐶 → (𝐴 = 〈𝑥, 𝑦〉 ↔ 𝐴 = 〈𝐶, 𝑦〉)) |
6 | 4 | eleq1d 2239 | . . . . 5 ⊢ (𝑥 = 𝐶 → (〈𝑥, 𝑦〉 ∈ 𝐵 ↔ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
7 | 5, 6 | anbi12d 470 | . . . 4 ⊢ (𝑥 = 𝐶 → ((𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵))) |
8 | 3, 7 | rexsn 3625 | . . 3 ⊢ (∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ (𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
9 | 8 | exbii 1598 | . 2 ⊢ (∃𝑦∃𝑥 ∈ {𝐶} (𝐴 = 〈𝑥, 𝑦〉 ∧ 〈𝑥, 𝑦〉 ∈ 𝐵) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
10 | 1, 2, 9 | 3bitri 205 | 1 ⊢ (𝐴 ∈ (𝐵 ↾ {𝐶}) ↔ ∃𝑦(𝐴 = 〈𝐶, 𝑦〉 ∧ 〈𝐶, 𝑦〉 ∈ 𝐵)) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 103 ↔ wb 104 = wceq 1348 ∃wex 1485 ∈ wcel 2141 ∃wrex 2449 Vcvv 2730 {csn 3581 〈cop 3584 ↾ cres 4611 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-pow 4158 ax-pr 4192 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ral 2453 df-rex 2454 df-v 2732 df-sbc 2956 df-un 3125 df-in 3127 df-ss 3134 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-opab 4049 df-xp 4615 df-rel 4616 df-res 4621 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |