![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > elvv | Structured version Visualization version 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 5165 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) | |
2 | vex 3234 | . . . . 5 ⊢ 𝑥 ∈ V | |
3 | vex 3234 | . . . . 5 ⊢ 𝑦 ∈ V | |
4 | 2, 3 | pm3.2i 470 | . . . 4 ⊢ (𝑥 ∈ V ∧ 𝑦 ∈ V) |
5 | 4 | biantru 525 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
6 | 5 | 2exbii 1815 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
7 | 1, 6 | bitr4i 267 | 1 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 383 = wceq 1523 ∃wex 1744 ∈ wcel 2030 Vcvv 3231 〈cop 4216 × cxp 5141 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-opab 4746 df-xp 5149 |
This theorem is referenced by: elvvv 5212 elvvuni 5213 elopaelxp 5225 ssrelOLD 5242 elrel 5256 copsex2gb 5263 relop 5305 elreldm 5382 dmsnn0 5635 funsndifnop 6456 1stval2 7227 2ndval2 7228 1st2val 7238 2nd2val 7239 dfopab2 7266 dfoprab3s 7267 dftpos4 7416 tpostpos 7417 fundmen 8071 fundmge2nop0 13312 ssrelf 29553 dfdm5 31800 dfrn5 31801 brtxp2 32113 pprodss4v 32116 brpprod3a 32118 brimg 32169 brxrn2 34277 fun2dmnopgexmpl 41626 |
Copyright terms: Public domain | W3C validator |