| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > copsex2gb | Structured version Visualization version GIF version | ||
| Description: Implicit substitution inference for ordered pairs. Compare copsex2ga 5784. (Contributed by NM, 12-Mar-2014.) |
| Ref | Expression |
|---|---|
| copsex2ga.1 | ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| copsex2gb | ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elvv 5725 | . . 3 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | 1 | anbi1i 636 | . 2 ⊢ ((𝐴 ∈ (V × V) ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
| 3 | 19.41vv 1982 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | copsex2ga.1 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
| 5 | 4 | pm5.32i 585 | . . 3 ⊢ ((𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 6 | 5 | 2exbii 1881 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 7 | 2, 3, 6 | 3bitr2ri 303 | 1 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∃wex 1811 ∈ wcel 2144 Vcvv 3450 〈cop 4589 × cxp 5648 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-ss 3896 df-in 4091 df-un 4151 df-sn 4584 df-pr 4586 df-op 4590 df-opab 5167 df-xp 5656 |
| This theorem is used by: copsex2ga 5784 elopaba 5785 dfxrn2 39393 elcnvlem 44677 |
| Copyright terms: Public domain | W3C validator |