Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ordeldif Structured version   Visualization version   GIF version

Theorem ordeldif 42581
Description: Membership in the difference of ordinals. (Contributed by RP, 15-Jan-2025.)
Assertion
Ref Expression
ordeldif ((Ord 𝐴 ∧ Ord 𝐵) → (𝐶 ∈ (𝐴𝐵) ↔ (𝐶𝐴𝐵𝐶)))

Proof of Theorem ordeldif
StepHypRef Expression
1 eldif 3953 . 2 (𝐶 ∈ (𝐴𝐵) ↔ (𝐶𝐴 ∧ ¬ 𝐶𝐵))
2 simpr 484 . . . . 5 ((Ord 𝐴 ∧ Ord 𝐵) → Ord 𝐵)
3 ordelord 6380 . . . . . 6 ((Ord 𝐴𝐶𝐴) → Ord 𝐶)
43adantlr 712 . . . . 5 (((Ord 𝐴 ∧ Ord 𝐵) ∧ 𝐶𝐴) → Ord 𝐶)
5 ordtri1 6391 . . . . 5 ((Ord 𝐵 ∧ Ord 𝐶) → (𝐵𝐶 ↔ ¬ 𝐶𝐵))
62, 4, 5syl2an2r 682 . . . 4 (((Ord 𝐴 ∧ Ord 𝐵) ∧ 𝐶𝐴) → (𝐵𝐶 ↔ ¬ 𝐶𝐵))
76bicomd 222 . . 3 (((Ord 𝐴 ∧ Ord 𝐵) ∧ 𝐶𝐴) → (¬ 𝐶𝐵𝐵𝐶))
87pm5.32da 578 . 2 ((Ord 𝐴 ∧ Ord 𝐵) → ((𝐶𝐴 ∧ ¬ 𝐶𝐵) ↔ (𝐶𝐴𝐵𝐶)))
91, 8bitrid 283 1 ((Ord 𝐴 ∧ Ord 𝐵) → (𝐶 ∈ (𝐴𝐵) ↔ (𝐶𝐴𝐵𝐶)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wcel 2098  cdif 3940  wss 3943  Ord word 6357
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2704  df-cleq 2718  df-clel 2804  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-pss 3962  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-tr 5259  df-eprel 5573  df-po 5581  df-so 5582  df-fr 5624  df-we 5626  df-ord 6361
This theorem is referenced by:  tfsconcatlem  42659  tfsconcatfv2  42663  tfsconcatrn  42665  tfsconcatb0  42667  tfsconcatrev  42671
  Copyright terms: Public domain W3C validator