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

Theorem onmindif 6426
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 3924 . . . 4 (𝑥 ∈ (𝐴 ∖ suc 𝐵) ↔ (𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵))
2 ssel2 3941 . . . . . . . . 9 ((𝐴 ⊆ On ∧ 𝑥𝐴) → 𝑥 ∈ On)
3 ontri1 6366 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↔ ¬ 𝐵𝑥))
4 onsssuc 6424 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵𝑥 ∈ suc 𝐵))
53, 4bitr3d 281 . . . . . . . . . 10 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝐵𝑥𝑥 ∈ suc 𝐵))
65con1bid 355 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
72, 6sylan 580 . . . . . . . 8 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
87biimpd 229 . . . . . . 7 (((𝐴 ⊆ On ∧ 𝑥𝐴) ∧ 𝐵 ∈ On) → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))
98exp31 419 . . . . . 6 (𝐴 ⊆ On → (𝑥𝐴 → (𝐵 ∈ On → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
109com23 86 . . . . 5 (𝐴 ⊆ On → (𝐵 ∈ On → (𝑥𝐴 → (¬ 𝑥 ∈ suc 𝐵𝐵𝑥))))
1110imp4b 421 . . . 4 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ∧ ¬ 𝑥 ∈ suc 𝐵) → 𝐵𝑥))
121, 11biimtrid 242 . . 3 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝑥 ∈ (𝐴 ∖ suc 𝐵) → 𝐵𝑥))
1312ralrimiv 3124 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥)
14 elintg 4918 . . 3 (𝐵 ∈ On → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1514adantl 481 . 2 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → (𝐵 (𝐴 ∖ suc 𝐵) ↔ ∀𝑥 ∈ (𝐴 ∖ suc 𝐵)𝐵𝑥))
1613, 15mpbird 257 1 ((𝐴 ⊆ On ∧ 𝐵 ∈ On) → 𝐵 (𝐴 ∖ suc 𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wcel 2109  wral 3044  cdif 3911  wss 3914   cint 4910  Oncon0 6332  suc csuc 6334
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-br 5108  df-opab 5170  df-tr 5215  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-ord 6335  df-on 6336  df-suc 6338
This theorem is referenced by:  unblem3  9241  fin23lem26  10278  inaex  44286
  Copyright terms: Public domain W3C validator