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

Theorem oneqmin 7743
Description: A way to show that an ordinal number equals the minimum of a nonempty collection of ordinal numbers: it must be in the collection, and it must not be larger than any member of the collection. (Contributed by NM, 14-Nov-2003.)
Assertion
Ref Expression
oneqmin ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = 𝐵 ↔ (𝐴𝐵 ∧ ∀𝑥𝐴 ¬ 𝑥𝐵)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem oneqmin
StepHypRef Expression
1 onint 7733 . . . 4 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → 𝐵𝐵)
2 eleq1 2827 . . . 4 (𝐴 = 𝐵 → (𝐴𝐵 𝐵𝐵))
31, 2syl5ibrcom 248 . . 3 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = 𝐵𝐴𝐵))
4 eleq2 2828 . . . . . . 7 (𝐴 = 𝐵 → (𝑥𝐴𝑥 𝐵))
54biimpd 230 . . . . . 6 (𝐴 = 𝐵 → (𝑥𝐴𝑥 𝐵))
6 onnmin 7741 . . . . . . . 8 ((𝐵 ⊆ On ∧ 𝑥𝐵) → ¬ 𝑥 𝐵)
76ex 413 . . . . . . 7 (𝐵 ⊆ On → (𝑥𝐵 → ¬ 𝑥 𝐵))
87con2d 134 . . . . . 6 (𝐵 ⊆ On → (𝑥 𝐵 → ¬ 𝑥𝐵))
95, 8syl9r 78 . . . . 5 (𝐵 ⊆ On → (𝐴 = 𝐵 → (𝑥𝐴 → ¬ 𝑥𝐵)))
109ralrimdv 3137 . . . 4 (𝐵 ⊆ On → (𝐴 = 𝐵 → ∀𝑥𝐴 ¬ 𝑥𝐵))
1110adantr 481 . . 3 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = 𝐵 → ∀𝑥𝐴 ¬ 𝑥𝐵))
123, 11jcad 517 . 2 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = 𝐵 → (𝐴𝐵 ∧ ∀𝑥𝐴 ¬ 𝑥𝐵)))
13 oneqmini 6363 . . 3 (𝐵 ⊆ On → ((𝐴𝐵 ∧ ∀𝑥𝐴 ¬ 𝑥𝐵) → 𝐴 = 𝐵))
1413adantr 481 . 2 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → ((𝐴𝐵 ∧ ∀𝑥𝐴 ¬ 𝑥𝐵) → 𝐴 = 𝐵))
1512, 14impbid 213 1 ((𝐵 ⊆ On ∧ 𝐵 ≠ ∅) → (𝐴 = 𝐵 ↔ (𝐴𝐵 ∧ ∀𝑥𝐴 ¬ 𝑥𝐵)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396   = wceq 1547  wcel 2119  wne 2934  wral 3053  wss 3883  c0 4261   cint 4877  Oncon0 6310
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-11 2168  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-br 5073  df-opab 5135  df-tr 5180  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-ord 6313  df-on 6314
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator