| 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 8919 | . . 3 ⊢ ≼ = ( ≺ ∪ ≈ ) | |
| 2 | 1 | eleq2i 2829 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ ≼ ↔ 〈𝐴, 𝐵〉 ∈ ( ≺ ∪ ≈ )) |
| 3 | df-br 5087 | . 2 ⊢ (𝐴 ≼ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≼ ) | |
| 4 | df-br 5087 | . . . 4 ⊢ (𝐴 ≺ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≺ ) | |
| 5 | df-br 5087 | . . . 4 ⊢ (𝐴 ≈ 𝐵 ↔ 〈𝐴, 𝐵〉 ∈ ≈ ) | |
| 6 | 4, 5 | orbi12i 915 | . . 3 ⊢ ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ (〈𝐴, 𝐵〉 ∈ ≺ ∨ 〈𝐴, 𝐵〉 ∈ ≈ )) |
| 7 | elun 4094 | . . 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 848 ∈ wcel 2114 ∪ cun 3888 〈cop 4574 class class class wbr 5086 ≈ cen 8884 ≼ cdom 8885 ≺ csdm 8886 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-br 5087 df-opab 5149 df-f1o 6500 df-en 8888 df-dom 8889 df-sdom 8890 |
| This theorem is referenced by: bren2 8924 domnsym 9035 domnsymfi 9128 modom 9155 carddom2 9895 axcc4dom 10357 entric 10473 entri2 10474 gchor 10544 frgpcyg 21566 iunmbl2 25537 dyadmbl 25580 padct 32809 volmeas 34394 ovoliunnfl 38000 ctbnfien 43267 |
| Copyright terms: Public domain | W3C validator |