| 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 5773. (Contributed by NM, 12-Mar-2014.) |
| Ref | Expression |
|---|---|
| copsex2ga.1 | ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| copsex2gb | ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elvv 5715 | . . 3 ⊢ (𝐴 ∈ (V × V) ↔ ∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉) | |
| 2 | 1 | anbi1i 632 | . 2 ⊢ ((𝐴 ∈ (V × V) ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
| 3 | 19.41vv 1964 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (∃𝑥∃𝑦 𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
| 4 | copsex2ga.1 | . . . 4 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) | |
| 5 | 4 | pm5.32i 581 | . . 3 ⊢ ((𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ (𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 6 | 5 | 2exbii 1863 | . 2 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓)) |
| 7 | 2, 3, 6 | 3bitr2ri 302 | 1 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ (𝐴 ∈ (V × V) ∧ 𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1554 ∃wex 1793 ∈ wcel 2136 Vcvv 3448 〈cop 4582 × cxp 5638 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-ext 2728 ax-sep 5240 ax-pr 5384 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-ex 1794 df-sb 2085 df-clab 2735 df-cleq 2748 df-clel 2831 df-rab 3409 df-v 3450 df-un 3904 df-in 3906 df-ss 3916 df-sn 4577 df-pr 4579 df-op 4583 df-opab 5157 df-xp 5646 |
| This theorem is referenced by: copsex2ga 5773 elopaba 5774 dfxrn2 38832 elcnvlem 44125 |
| Copyright terms: Public domain | W3C validator |