Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > otthne | Structured version Visualization version GIF version |
Description: Contrapositive of the ordered triple theorem. (Contributed by Scott Fenton, 21-Aug-2024.) |
Ref | Expression |
---|---|
otthne.1 | ⊢ 𝐴 ∈ V |
otthne.2 | ⊢ 𝐵 ∈ V |
otthne.3 | ⊢ 𝐶 ∈ V |
Ref | Expression |
---|---|
otthne | ⊢ (〈〈𝐴, 𝐵〉, 𝐶〉 ≠ 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | otthne.1 | . . . 4 ⊢ 𝐴 ∈ V | |
2 | otthne.2 | . . . 4 ⊢ 𝐵 ∈ V | |
3 | 1, 2 | opthne 5346 | . . 3 ⊢ (〈𝐴, 𝐵〉 ≠ 〈𝐷, 𝐸〉 ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸)) |
4 | 3 | orbi1i 911 | . 2 ⊢ ((〈𝐴, 𝐵〉 ≠ 〈𝐷, 𝐸〉 ∨ 𝐶 ≠ 𝐹) ↔ ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸) ∨ 𝐶 ≠ 𝐹)) |
5 | opex 5328 | . . 3 ⊢ 〈𝐴, 𝐵〉 ∈ V | |
6 | otthne.3 | . . 3 ⊢ 𝐶 ∈ V | |
7 | 5, 6 | opthne 5346 | . 2 ⊢ (〈〈𝐴, 𝐵〉, 𝐶〉 ≠ 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (〈𝐴, 𝐵〉 ≠ 〈𝐷, 𝐸〉 ∨ 𝐶 ≠ 𝐹)) |
8 | df-3or 1085 | . 2 ⊢ ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹) ↔ ((𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸) ∨ 𝐶 ≠ 𝐹)) | |
9 | 4, 7, 8 | 3bitr4i 306 | 1 ⊢ (〈〈𝐴, 𝐵〉, 𝐶〉 ≠ 〈〈𝐷, 𝐸〉, 𝐹〉 ↔ (𝐴 ≠ 𝐷 ∨ 𝐵 ≠ 𝐸 ∨ 𝐶 ≠ 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∨ wo 844 ∨ w3o 1083 ∈ wcel 2111 ≠ wne 2951 Vcvv 3409 〈cop 4531 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2729 ax-sep 5173 ax-nul 5180 ax-pr 5302 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-sb 2070 df-clab 2736 df-cleq 2750 df-clel 2830 df-ne 2952 df-v 3411 df-dif 3863 df-un 3865 df-nul 4228 df-if 4424 df-sn 4526 df-pr 4528 df-op 4532 |
This theorem is referenced by: xpord3lem 33362 xpord3pred 33365 xpord3ind 33367 no3indslem 33697 |
Copyright terms: Public domain | W3C validator |