![]() |
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 5711 | . 2 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) | |
2 | vex 3481 | . . . . 5 ⊢ 𝑥 ∈ V | |
3 | vex 3481 | . . . . 5 ⊢ 𝑦 ∈ V | |
4 | 2, 3 | pm3.2i 470 | . . . 4 ⊢ (𝑥 ∈ V ∧ 𝑦 ∈ V) |
5 | 4 | biantru 529 | . . 3 ⊢ (𝐴 = 〈𝑥, 𝑦〉 ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
6 | 5 | 2exbii 1845 | . 2 ⊢ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ V ∧ 𝑦 ∈ V))) |
7 | 1, 6 | bitr4i 278 | 1 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1536 ∃wex 1775 ∈ wcel 2105 Vcvv 3477 〈cop 4636 × cxp 5686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-sb 2062 df-clab 2712 df-cleq 2726 df-clel 2813 df-v 3479 df-dif 3965 df-un 3967 df-ss 3979 df-nul 4339 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-opab 5210 df-xp 5694 |
This theorem is referenced by: elvvv 5763 elvvuni 5764 elopaelxpOLD 5778 elrel 5810 copsex2gb 5818 relop 5863 elreldm 5948 dmsnn0 6228 funsndifnop 7170 1stval2 8029 2ndval2 8030 1st2val 8040 2nd2val 8041 dfopab2 8075 dfoprab3s 8076 dftpos4 8268 tpostpos 8269 fundmen 9069 cnvfi 9214 fundmge2nop0 14537 ssrelf 32634 fineqvac 35089 dfdm5 35753 dfrn5 35754 brtxp2 35862 pprodss4v 35865 brpprod3a 35867 brimg 35918 brxrn2 38356 fun2dmnopgexmpl 47233 |
Copyright terms: Public domain | W3C validator |