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

Theorem onmindif 6436
Description: When its successor is subtracted from a class of ordinal numbers, an ordinal number is less than the minimum of the resulting subclass. (Contributed by NM, 1-Dec-2003.)
Assertion
Ref Expression
onmindif ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → 𝐵 (𝐴 ∖ suc 𝐵))

Proof of Theorem onmindif
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 eldif 3914 . . . 4 (𝑥 ∈ (𝐴 ∖ suc 𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵))
2 ssel2 3931 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
3 ontri1 6376 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↔ ¬ 𝐵𝑥))
4 onsssuc 6434 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵𝑥 ∈ suc 𝐵))
53, 4bitr3d 283 . . . . . . . . . 10 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝐵𝑥𝑥 ∈ suc 𝐵))
65con1bid 357 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
72, 6sylan 589 . . . . . . . 8 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
87biimpd 231 . . . . . . 7 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
98exp31 423 . . . . . 6 (𝐴 ⊆ On → (𝑥𝐴 → (𝐵 ∈ On → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
109com23 86 . . . . 5 (𝐴 ⊆ On → (𝐵 ∈ On → (𝑥𝐴 → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
1110imp4b 425 . . . 4 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵) → 𝐵𝑥))
121, 11biimtrid 244 . . 3 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝑥 ∈ (𝐴 ∖ suc 𝐵) → 𝐵𝑥))
1312ralrimiv 3152 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥)
14 elintg 4912 . . 3 (𝐵 ∈ On → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1514adantl 485 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1613, 15mpbird 259 1 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → 𝐵 (𝐴 ∖ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399  wcel 2141  wral 3075  cdif 3901  wss 3904   cint 4904  Oncon0 6342  suc csuc 6344
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733  ax-sep 5245  ax-pr 5389
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4905  df-br 5100  df-opab 5162  df-tr 5207  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-ord 6345  df-on 6346  df-suc 6348
This theorem is referenced by:  unblem3  9234  fin23lem26  10279  inaex  44837
  Copyright terms: Public domain W3C validator