| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > opthne | Structured version Visualization version GIF version | ||
| Description: Two ordered pairs are not equal iff their first components or their second components are not equal. (Contributed by AV, 13-Dec-2018.) |
| Ref | Expression |
|---|---|
| opthne.1 | ⊢ 𝐴 ∈ V |
| opthne.2 | ⊢ 𝐵 ∈ V |
| Ref | Expression |
|---|---|
| opthne | ⊢ (〈𝐴, 𝐵〉 ≠ 〈𝐶, 𝐷〉 ↔ (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opthne.1 | . 2 ⊢ 𝐴 ∈ V | |
| 2 | opthne.2 | . 2 ⊢ 𝐵 ∈ V | |
| 3 | opthneg 5449 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (〈𝐴, 𝐵〉 ≠ 〈𝐶, 𝐷〉 ↔ (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷))) | |
| 4 | 1, 2, 3 | mp2an 705 | 1 ⊢ (〈𝐴, 𝐵〉 ≠ 〈𝐶, 𝐷〉 ↔ (𝐴 ≠ 𝐶 ∨ 𝐵 ≠ 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∨ wo 861 ∈ wcel 2144 ≠ wne 2955 Vcvv 3450 〈cop 4834 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-un 4151 df-nul 4279 df-if 4482 df-sn 4585 df-pr 4587 df-op 4835 |
| This theorem is used by: xpord2lem 8162 xpord2pred 8165 xpord2indlem 8167 degenmgm 19143 degenmgm2 19146 m2detleib 22952 addsqnreup 27776 mulsval 28501 gpgedg2ov 49258 gpgedg2iv 49259 gpg5nbgrvtx03starlem1 49260 gpg5nbgrvtx03starlem2 49261 gpg5nbgrvtx03starlem3 49262 gpg5nbgrvtx13starlem1 49263 gpg5nbgrvtx13starlem2 49264 gpg5nbgrvtx13starlem3 49265 gpg3nbgrvtx0 49268 gpg3nbgrvtx0ALT 49269 gpg3nbgrvtx1 49270 gpg3kgrtriex 49281 gpgprismgr4cycllem2 49288 gpgprismgr4cycllem7 49293 gpg5edgnedg 49322 zlmodzxzldeplem 49704 |
| Copyright terms: Public domain | W3C validator |