| 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 8915 | . . 3 ⊢ ≼ = ( ≺ ∪ ≈ ) | |
| 2 | 1 | eleq2i 2831 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ≼ ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 3 | df-br 5073 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≼ ) | |
| 4 | df-br 5073 | . . . 4 ⊢ (𝐴 ≺ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≺ ) | |
| 5 | df-br 5073 | . . . 4 ⊢ (𝐴 ≈ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≈ ) | |
| 6 | 4, 5 | orbi12i 920 | . . 3 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) |
| 7 | elun 4083 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ ) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) | |
| 8 | 6, 7 | bitr4i 279 | . 2 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 9 | 2, 3, 8 | 3bitr4i 304 | 1 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 207 ∨ wo 853 ∈ wcel 2119 ∪ cun 3881 〈cop 4561 class class class wbr 5072 ≈ cen 8880 ≼ cdom 8881 ≺ csdm 8882 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2711 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2718 df-cleq 2731 df-clel 2814 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4262 df-br 5073 df-opab 5135 df-f1o 6492 df-en 8884 df-dom 8885 df-sdom 8886 |
| This theorem is referenced by: bren2 8920 domnsym 9031 domnsymfi 9124 modom 9151 carddom2 9892 axcc4dom 10354 entric 10470 entri2 10471 gchor 10541 frgpcyg 21548 iunmbl2 25542 dyadmbl 25585 padct 32810 volmeas 34415 ovoliunnfl 38029 ctbnfien 43263 |
| Copyright terms: Public domain | W3C validator |