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

Theorem onmindif 5732
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 3550 . . . 4 (𝑥 ∈ (𝐴 ∖ suc 𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵))
2 ssel2 3563 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
3 ontri1 5674 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↔ ¬ 𝐵𝑥))
4 onsssuc 5730 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵𝑥 ∈ suc 𝐵))
53, 4bitr3d 269 . . . . . . . . . 10 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝐵𝑥𝑥 ∈ suc 𝐵))
65con1bid 344 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
72, 6sylan 487 . . . . . . . 8 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
87biimpd 218 . . . . . . 7 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
98exp31 628 . . . . . 6 (𝐴 ⊆ On → (𝑥𝐴 → (𝐵 ∈ On → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
109com23 84 . . . . 5 (𝐴 ⊆ On → (𝐵 ∈ On → (𝑥𝐴 → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
1110imp4b 611 . . . 4 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵) → 𝐵𝑥))
121, 11syl5bi 231 . . 3 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝑥 ∈ (𝐴 ∖ suc 𝐵) → 𝐵𝑥))
1312ralrimiv 2948 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥)
14 elintg 4418 . . 3 (𝐵 ∈ On → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1514adantl 481 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1613, 15mpbird 246 1 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → 𝐵 (𝐴 ∖ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 195  wa 383  wcel 1977  wral 2896  cdif 3537  wss 3540   cint 4410  Oncon0 5640  suc csuc 5642
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3or 1032  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-pss 3556  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-int 4411  df-br 4584  df-opab 4644  df-tr 4681  df-eprel 4949  df-po 4959  df-so 4960  df-fr 4997  df-we 4999  df-ord 5643  df-on 5644  df-suc 5646
This theorem is referenced by:  unblem3  8099  fin23lem26  9030
  Copyright terms: Public domain W3C validator