| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > optocl | Structured version Visualization version GIF version | ||
| Description: Implicit substitution of class for ordered pair. (Contributed by NM, 5-Mar-1995.) Shorten and reduce axiom usage. (Revised by TM, 29-Dec-2025.) |
| Ref | Expression |
|---|---|
| optocl.1 | ⊢ 𝐷 = (𝐵 × 𝐶) |
| optocl.2 | ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (𝜑 ↔ 𝜓)) |
| optocl.3 | ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑) |
| Ref | Expression |
|---|---|
| optocl | ⊢ (𝐴 ∈ 𝐷 → 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elxpi 5636 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → ∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶))) | |
| 2 | optocl.3 | . . . . . 6 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜑) | |
| 3 | optocl.2 | . . . . . . 7 ⊢ (〈𝑥, 𝑦〉 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 4 | 3 | eqcoms 2739 | . . . . . 6 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → (𝜑 ↔ 𝜓)) |
| 5 | 2, 4 | imbitrid 244 | . . . . 5 ⊢ (𝐴 = 〈𝑥, 𝑦〉 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶) → 𝜓)) |
| 6 | 5 | imp 406 | . . . 4 ⊢ ((𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → 𝜓) |
| 7 | 6 | exlimivv 1933 | . . 3 ⊢ (∃𝑥∃𝑦(𝐴 = 〈𝑥, 𝑦〉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐶)) → 𝜓) |
| 8 | 1, 7 | syl 17 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝜓) |
| 9 | optocl.1 | . 2 ⊢ 𝐷 = (𝐵 × 𝐶) | |
| 10 | 8, 9 | eleq2s 2849 | 1 ⊢ (𝐴 ∈ 𝐷 → 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2111 〈cop 4579 × cxp 5612 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-opab 5152 df-xp 5620 |
| This theorem is referenced by: 2optocl 5710 3optocl 5711 ecoptocl 8731 ax1rid 11052 axcnre 11055 |
| Copyright terms: Public domain | W3C validator |