MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  brdom2 Structured version   Visualization version   GIF version

Theorem brdom2 9009
Description: Dominance in terms of strict dominance and equinumerosity. Theorem 22(iv) of [Suppes] p. 97. (Contributed by NM, 17-Jun-1998.)
Assertion
Ref Expression
brdom2 (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵))

Proof of Theorem brdom2
StepHypRef Expression
1 dfdom2 9005 . . 3 ≼ = ( ≺ ∪ ≈ )
21eleq2i 2853 . 2 (⟨𝐴, 𝐵⟩ ∈ ≼ ↔ ⟨𝐴, 𝐵⟩ ∈ ( ≺ ∪ ≈ ))
3 df-br 5104 . 2 (𝐴 ≼ 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ≼ )
4 df-br 5104 . . . 4 (𝐴 ≺ 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ≺ )
5 df-br 5104 . . . 4 (𝐴 ≈ 𝐵 ↔ ⟨𝐴, 𝐵⟩ ∈ ≈ )
64, 5orbi12i 928 . . 3 ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ (⟨𝐴, 𝐵⟩ ∈ ≺ ∨ ⟨𝐴, 𝐵⟩ ∈ ≈ ))
7 elun 4100 . . 3 (⟨𝐴, 𝐵⟩ ∈ ( ≺ ∪ ≈ ) ↔ (⟨𝐴, 𝐵⟩ ∈ ≺ ∨ ⟨𝐴, 𝐵⟩ ∈ ≈ ))
86, 7bitr4i 281 . 2 ((𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵) ↔ ⟨𝐴, 𝐵⟩ ∈ ( ≺ ∪ ≈ ))
92, 3, 83bitr4i 306 1 (𝐴 ≼ 𝐵 ↔ (𝐴 ≺ 𝐵 ∨ 𝐴 ≈ 𝐵))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∨ wo 861   ∈ wcel 2145   ∪ cun 3897  ⟨cop 4590   class class class wbr 5103   ≈ cen 8970   ≼ cdom 8971   ≺ csdm 8972
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-br 5104  df-opab 5168  df-f1o 6545  df-en 8974  df-dom 8975  df-sdom 8976
This theorem is used by:  bren2  9010  domnsym  9122  domnsymfi  9215  modom  9242  carddom2  10058  axcc4dom  10519  entric  10641  entri2  10642  gchor  10712  frgpcyg  21879  iunmbl2  25878  dyadmbl  25921  padct  33310  volmeas  34864  ovoliunnfl  38580  ctbnfien  43824
  Copyright terms: Public domain W3C validator