| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > brdom2 | Structured version Visualization version GIF version | ||
| Description: Dominance in terms of strict dominance and equinumerosity. Theorem 22(iv) of [Suppes] p. 97. (Contributed by NM, 17-Jun-1998.) |
| Ref | Expression |
|---|---|
| brdom2 | ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfdom2 8959 | . . 3 ⊢ ≼ = ( ≺ ∪ ≈ ) | |
| 2 | 1 | eleq2i 2854 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ≼ ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 3 | df-br 5101 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≼ ) | |
| 4 | df-br 5101 | . . . 4 ⊢ (𝐴 ≺ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≺ ) | |
| 5 | df-br 5101 | . . . 4 ⊢ (𝐴 ≈ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≈ ) | |
| 6 | 4, 5 | orbi12i 925 | . . 3 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) |
| 7 | elun 4106 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ ) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) | |
| 8 | 6, 7 | bitr4i 280 | . 2 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 9 | 2, 3, 8 | 3bitr4i 305 | 1 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∨ wo 858 ∈ wcel 2142 ∪ cun 3902 〈cop 4588 class class class wbr 5100 ≈ cen 8924 ≼ cdom 8925 ≺ csdm 8926 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-br 5101 df-opab 5163 df-f1o 6528 df-en 8928 df-dom 8929 df-sdom 8930 |
| This theorem is referenced by: bren2 8964 domnsym 9075 domnsymfi 9168 modom 9195 carddom2 9935 axcc4dom 10398 entric 10514 entri2 10515 gchor 10585 frgpcyg 21625 iunmbl2 25619 dyadmbl 25662 padct 32920 volmeas 34528 ovoliunnfl 38161 ctbnfien 43395 |
| Copyright terms: Public domain | W3C validator |