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

Theorem onmindif 6411
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 3900 . . . 4 (𝑥 ∈ (𝐴 ∖ suc 𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵))
2 ssel2 3917 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
3 ontri1 6351 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↔ ¬ 𝐵𝑥))
4 onsssuc 6409 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵𝑥 ∈ suc 𝐵))
53, 4bitr3d 282 . . . . . . . . . 10 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝐵𝑥𝑥 ∈ suc 𝐵))
65con1bid 356 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
72, 6sylan 586 . . . . . . . 8 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
87biimpd 230 . . . . . . 7 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
98exp31 420 . . . . . 6 (𝐴 ⊆ On → (𝑥𝐴 → (𝐵 ∈ On → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
109com23 86 . . . . 5 (𝐴 ⊆ On → (𝐵 ∈ On → (𝑥𝐴 → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
1110imp4b 422 . . . 4 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵) → 𝐵𝑥))
121, 11biimtrid 243 . . 3 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝑥 ∈ (𝐴 ∖ suc 𝐵) → 𝐵𝑥))
1312ralrimiv 3131 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥)
14 elintg 4892 . . 3 (𝐵 ∈ On → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1514adantl 482 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1613, 15mpbird 258 1 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → 𝐵 (𝐴 ∖ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wcel 2119  wral 3054  cdif 3887  wss 3890   cint 4884  Oncon0 6317  suc csuc 6319
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-ext 2712  ax-sep 5225  ax-pr 5369
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 2719  df-cleq 2732  df-clel 2815  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-tr 5187  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-ord 6320  df-on 6321  df-suc 6323
This theorem is referenced by:  unblem3  9201  fin23lem26  10245  inaex  44748
  Copyright terms: Public domain W3C validator