![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > elvv | GIF version |
Description: Membership in universal class of ordered pairs. (Contributed by NM, 4-Jul-1994.) |
Ref | Expression |
---|---|
elvv | ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxp 4676 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) | |
2 | vex 2763 | . . . . 5 ⊢ 𝑥 ∈ V | |
3 | vex 2763 | . . . . 5 ⊢ 𝑦 ∈ V | |
4 | 2, 3 | pm3.2i 272 | . . . 4 ⊢ (𝑥 ∈ V ∧ 𝑦 ∈ V) |
5 | 4 | biantru 302 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
6 | 5 | 2exbii 1617 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
7 | 1, 6 | bitr4i 187 | 1 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 = wceq 1364 ∃wex 1503 ∈ wcel 2164 Vcvv 2760 〈cop 3621 × cxp 4657 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-opab 4091 df-xp 4665 |
This theorem is referenced by: elvvv 4722 elvvuni 4723 ssrel 4747 elrel 4761 relop 4812 elreldm 4888 dmsnm 5131 1stval2 6208 2ndval2 6209 dfopab2 6242 dfoprab3s 6243 dftpos4 6316 tpostpos 6317 fundmen 6860 |
Copyright terms: Public domain | W3C validator |