| 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 5450 | . 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 2145 ≠ wne 2956 Vcvv 3451 〈cop 4590 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 ax-sep 5249 ax-pr 5391 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ne 2957 df-rab 3414 df-v 3453 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 |
| This theorem is used by: xpord2lem 8152 xpord2pred 8155 xpord2indlem 8157 degenmgm 19130 degenmgm2 19133 m2detleib 22939 addsqnreup 27763 mulsval 28488 gpgedg2ov 49133 gpgedg2iv 49134 gpg5nbgrvtx03starlem1 49135 gpg5nbgrvtx03starlem2 49136 gpg5nbgrvtx03starlem3 49137 gpg5nbgrvtx13starlem1 49138 gpg5nbgrvtx13starlem2 49139 gpg5nbgrvtx13starlem3 49140 gpg3nbgrvtx0 49143 gpg3nbgrvtx0ALT 49144 gpg3nbgrvtx1 49145 gpg3kgrtriex 49156 gpgprismgr4cycllem2 49163 gpgprismgr4cycllem7 49168 gpg5edgnedg 49197 zlmodzxzldeplem 49579 line2x 49835 inlinecirc02plem 49867 |
| Copyright terms: Public domain | W3C validator |