![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > brdifun | Structured version Visualization version GIF version |
Description: Evaluate the incomparability relation. (Contributed by Mario Carneiro, 9-Jul-2014.) |
Ref | Expression |
---|---|
swoer.1 | ⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < )) |
Ref | Expression |
---|---|
brdifun | ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelxpi 5671 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋)) | |
2 | df-br 5107 | . . . 4 ⊢ (𝐴(𝑋 × 𝑋)𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ (𝑋 × 𝑋)) | |
3 | 1, 2 | sylibr 233 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝐴(𝑋 × 𝑋)𝐵) |
4 | swoer.1 | . . . . . 6 ⊢ 𝑅 = ((𝑋 × 𝑋) ∖ ( < ∪ ◡ < )) | |
5 | 4 | breqi 5112 | . . . . 5 ⊢ (𝐴𝑅𝐵 ↔ 𝐴((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))𝐵) |
6 | brdif 5159 | . . . . 5 ⊢ (𝐴((𝑋 × 𝑋) ∖ ( < ∪ ◡ < ))𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < ∪ ◡ < )𝐵)) | |
7 | 5, 6 | bitri 275 | . . . 4 ⊢ (𝐴𝑅𝐵 ↔ (𝐴(𝑋 × 𝑋)𝐵 ∧ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
8 | 7 | baib 537 | . . 3 ⊢ (𝐴(𝑋 × 𝑋)𝐵 → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
9 | 3, 8 | syl 17 | . 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ 𝐴( < ∪ ◡ < )𝐵)) |
10 | brun 5157 | . . . 4 ⊢ (𝐴( < ∪ ◡ < )𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴◡ < 𝐵)) | |
11 | brcnvg 5836 | . . . . 5 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴◡ < 𝐵 ↔ 𝐵 < 𝐴)) | |
12 | 11 | orbi2d 915 | . . . 4 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴 < 𝐵 ∨ 𝐴◡ < 𝐵) ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
13 | 10, 12 | bitrid 283 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴( < ∪ ◡ < )𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
14 | 13 | notbid 318 | . 2 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (¬ 𝐴( < ∪ ◡ < )𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
15 | 9, 14 | bitrd 279 | 1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝑅𝐵 ↔ ¬ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ∖ cdif 3908 ∪ cun 3909 ⟨cop 4593 class class class wbr 5106 × cxp 5632 ◡ccnv 5633 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2708 ax-sep 5257 ax-nul 5264 ax-pr 5385 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2715 df-cleq 2729 df-clel 2815 df-ral 3066 df-rex 3075 df-rab 3409 df-v 3448 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-sn 4588 df-pr 4590 df-op 4594 df-br 5107 df-opab 5169 df-xp 5640 df-cnv 5642 |
This theorem is referenced by: swoer 8679 swoord1 8680 swoord2 8681 swoso 8682 |
Copyright terms: Public domain | W3C validator |