| 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 8913 | . . 3 ⊢ ≼ = ( ≺ ∪ ≈ ) | |
| 2 | 1 | eleq2i 2826 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ≼ ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 3 | df-br 5097 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≼ ) | |
| 4 | df-br 5097 | . . . 4 ⊢ (𝐴 ≺ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≺ ) | |
| 5 | df-br 5097 | . . . 4 ⊢ (𝐴 ≈ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≈ ) | |
| 6 | 4, 5 | orbi12i 914 | . . 3 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) |
| 7 | elun 4103 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ ) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) | |
| 8 | 6, 7 | bitr4i 278 | . 2 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 9 | 2, 3, 8 | 3bitr4i 303 | 1 ⊢ (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∨ wo 847 ∈ wcel 2113 ∪ cun 3897 〈cop 4584 class class class wbr 5096 ≈ cen 8878 ≼ cdom 8879 ≺ csdm 8880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-ext 2706 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2713 df-cleq 2726 df-clel 2809 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-br 5097 df-opab 5159 df-f1o 6497 df-en 8882 df-dom 8883 df-sdom 8884 |
| This theorem is referenced by: bren2 8918 domnsym 9029 domnsymfi 9122 modom 9149 carddom2 9887 axcc4dom 10349 entric 10465 entri2 10466 gchor 10536 frgpcyg 21526 iunmbl2 25512 dyadmbl 25555 padct 32746 volmeas 34337 ovoliunnfl 37802 ctbnfien 43002 |
| Copyright terms: Public domain | W3C validator |