Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > altopth | Structured version Visualization version GIF version |
Description: The alternate ordered pair theorem. If two alternate ordered pairs are equal, their first elements are equal and their second elements are equal. Note that 𝐶 and 𝐷 are not required to be a set due to a peculiarity of our specific ordered pair definition, as opposed to the regular ordered pairs used here, which (as in opth 5370), requires 𝐷 to be a set. (Contributed by Scott Fenton, 23-Mar-2012.) |
Ref | Expression |
---|---|
altopth.1 | ⊢ 𝐴 ∈ V |
altopth.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
altopth | ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | altopth.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | altopth.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | altopthg 33430 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷))) | |
4 | 1, 2, 3 | mp2an 690 | 1 ⊢ (⟪𝐴, 𝐵⟫ = ⟪𝐶, 𝐷⟫ ↔ (𝐴 = 𝐶 ∧ 𝐵 = 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ⟪caltop 33419 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pr 5332 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-sn 4570 df-pr 4572 df-altop 33421 |
This theorem is referenced by: altopthd 33435 altopelaltxp 33439 |
Copyright terms: Public domain | W3C validator |