| 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 36419 | . 2 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ ({𝐴} = {𝐶} ∧ {𝐵} = {𝐷})) | |
| 2 | sneqbg 4807 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ({𝐴} = {𝐶} ↔ 𝐴 = 𝐶)) | |
| 3 | sneqbg 4807 | . . . 4 ⊢ (𝐷 ∈ 𝑊 → ({𝐷} = {𝐵} ↔ 𝐷 = 𝐵)) | |
| 4 | eqcom 2768 | . . . 4 ⊢ ({𝐵} = {𝐷} ↔ {𝐷} = {𝐵}) | |
| 5 | eqcom 2768 | . . . 4 ⊢ (𝐵 = 𝐷 ↔ 𝐷 = 𝐵) | |
| 6 | 3, 4, 5 | 3bitr4g 317 | . . 3 ⊢ (𝐷 ∈ 𝑊 → ({𝐵} = {𝐷} ↔ 𝐵 = 𝐷)) |
| 7 | 2, 6 | bi2anan9 649 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (({𝐴} = {𝐶} ∧ {𝐵} = {𝐷}) ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| 8 | 1, 7 | bitrid 286 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝑊) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∈ wcel 2141 {csn 4588 ⟪caltop 36414 |
| 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 2143 ax-9 2151 ax-ext 2733 ax-sep 5256 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-tru 1571 df-ex 1808 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3455 df-un 3909 df-ss 3921 df-sn 4589 df-pr 4591 df-altop 36416 |
| This theorem is referenced by: altopthb 36428 |
| Copyright terms: Public domain | W3C validator |