Users' Mathboxes Mathbox for Frédéric Liné < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  untindd Unicode version

Theorem untindd 25019
Description: An "induction principle" for until, roughly stating that it is the least fixed point satisfying a property like ax-ltl5 24993. (Contributed by Mario Carneiro, 30-Aug-2016.)
Hypotheses
Ref Expression
untindd.1  |-  ( ps 
->  th )
untindd.2  |-  ( (
ph  /\  () th )  ->  th )
Assertion
Ref Expression
untindd  |-  ( (
ph  until  ps )  ->  th )

Proof of Theorem untindd
StepHypRef Expression
1 untindd.1 . . . 4  |-  ( ps 
->  th )
2 untindd.2 . . . 4  |-  ( (
ph  /\  () th )  ->  th )
31, 2jaoi 368 . . 3  |-  ( ( ps  \/  ( ph  /\  () th ) )  ->  th )
43ax-lmp 24978 . 2  |-  [.] (
( ps  \/  ( ph  /\  () th )
)  ->  th )
5 untind 25018 . 2  |-  ( [.] ( ( ps  \/  ( ph  /\  () th ) )  ->  th )  ->  ( ( ph  until  ps )  ->  th ) )
64, 5ax-mp 8 1  |-  ( (
ph  until  ps )  ->  th )
Colors of variables: wff set class
Syntax hints:    -> wi 4    \/ wo 357    /\ wa 358   [.]wbox 24970   ()wcirc 24972    until wunt 24973
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-ltl1 24974  ax-ltl2 24975  ax-ltl3 24976  ax-ltl4 24977  ax-lmp 24978  ax-nmp 24979  ax-ltl5 24993  ax-ltl6 24994
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-dia 24980
  Copyright terms: Public domain W3C validator