| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > copsex2dv | Structured version Visualization version GIF version | ||
| Description: Implicit substitution deduction for ordered pairs. (Contributed by Thierry Arnoux, 4-May-2025.) |
| Ref | Expression |
|---|---|
| copsex2dv.a | ⊢ (𝜑 → 𝐴 ∈ 𝑈) |
| copsex2dv.b | ⊢ (𝜑 → 𝐵 ∈ 𝑉) |
| copsex2dv.1 | ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| copsex2dv | ⊢ (𝜑 → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | copsex2dv.1 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 = 𝐴 ∧ 𝑦 = 𝐵)) → (𝜓 ↔ 𝜒)) | |
| 2 | 1 | ex 417 | . . 3 ⊢ (𝜑 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 3 | 2 | alrimivv 1956 | . 2 ⊢ (𝜑 → ∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒))) |
| 4 | copsex2dv.a | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑈) | |
| 5 | copsex2dv.b | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑉) | |
| 6 | copsex2t 5479 | . 2 ⊢ ((∀𝑥∀𝑦((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝜓 ↔ 𝜒)) ∧ (𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑉)) → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) | |
| 7 | 3, 4, 5, 6 | syl12anc 849 | 1 ⊢ (𝜑 → (∃𝑥∃𝑦(〈𝐴, 𝐵〉 = 〈𝑥, 𝑦〉 ∧ 𝜓) ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1566 = wceq 1568 ∃wex 1807 ∈ wcel 2150 〈cop 4600 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-pr 5408 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 |
| This theorem is referenced by: brab2d 5526 brab2dd 49555 |
| Copyright terms: Public domain | W3C validator |