| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > altopthbg | Structured version Visualization version GIF version | ||
| Description: Alternate ordered pair theorem. (Contributed by Scott Fenton, 14-Apr-2012.) |
| Ref | Expression |
|---|---|
| altopthbg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | altopthsn 36249 | . 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷})) | |
| 2 | sneqbg 4791 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐶} ↔ 𝐴 = 𝐶)) | |
| 3 | sneqbg 4791 | . . . 4 ⊢ (𝐷 ∈ 𝑊 → ({𝐷} = {𝐵} ↔ 𝐷 = 𝐵)) | |
| 4 | eqcom 2759 | . . . 4 ⊢ ({𝐵} = {𝐷} ↔ {𝐷} = {𝐵}) | |
| 5 | eqcom 2759 | . . . 4 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵) | |
| 6 | 3, 4, 5 | 3bitr4g 316 | . . 3 ⊢ (𝐷 ∈ 𝑊 → ({𝐵} = {𝐷} ↔ 𝐵 = 𝐷)) |
| 7 | 2, 6 | bi2anan9 646 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| 8 | 1, 7 | bitrid 285 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1550 ∈ wcel 2132 {csn 4572 ⟪caltop 36244 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 ax-sep 5236 ax-pr 5380 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-tru 1553 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-v 3446 df-un 3900 df-ss 3912 df-sn 4573 df-pr 4575 df-altop 36246 |
| This theorem is referenced by: altopthb 36258 |
| Copyright terms: Public domain | W3C validator |