Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wsuclb Structured version   Visualization version   GIF version

Theorem wsuclb 34788
Description: A well-founded successor is a lower bound on points after 𝑋. (Contributed by Scott Fenton, 16-Jun-2018.) (Proof shortened by AV, 10-Oct-2021.)
Hypotheses
Ref Expression
wsuclb.1 (𝜑𝑅 We 𝐴)
wsuclb.2 (𝜑𝑅 Se 𝐴)
wsuclb.3 (𝜑𝑋𝑉)
wsuclb.4 (𝜑𝑌𝐴)
wsuclb.5 (𝜑𝑋𝑅𝑌)
Assertion
Ref Expression
wsuclb (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋))

Proof of Theorem wsuclb
Dummy variables 𝑎 𝑏 𝑐 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 wsuclb.5 . . . . 5 (𝜑𝑋𝑅𝑌)
2 wsuclb.4 . . . . . 6 (𝜑𝑌𝐴)
3 wsuclb.3 . . . . . 6 (𝜑𝑋𝑉)
4 brcnvg 5877 . . . . . 6 ((𝑌𝐴𝑋𝑉) → (𝑌𝑅𝑋𝑋𝑅𝑌))
52, 3, 4syl2anc 584 . . . . 5 (𝜑 → (𝑌𝑅𝑋𝑋𝑅𝑌))
61, 5mpbird 256 . . . 4 (𝜑𝑌𝑅𝑋)
7 elpredg 6311 . . . . 5 ((𝑋𝑉𝑌𝐴) → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅𝑋))
83, 2, 7syl2anc 584 . . . 4 (𝜑 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅𝑋))
96, 8mpbird 256 . . 3 (𝜑𝑌 ∈ Pred(𝑅, 𝐴, 𝑋))
10 wsuclb.1 . . . . 5 (𝜑𝑅 We 𝐴)
11 weso 5666 . . . . 5 (𝑅 We 𝐴𝑅 Or 𝐴)
1210, 11syl 17 . . . 4 (𝜑𝑅 Or 𝐴)
13 wsuclb.2 . . . . 5 (𝜑𝑅 Se 𝐴)
14 breq2 5151 . . . . . . 7 (𝑦 = 𝑌 → (𝑋𝑅𝑦𝑋𝑅𝑌))
1514rspcev 3612 . . . . . 6 ((𝑌𝐴𝑋𝑅𝑌) → ∃𝑦𝐴 𝑋𝑅𝑦)
162, 1, 15syl2anc 584 . . . . 5 (𝜑 → ∃𝑦𝐴 𝑋𝑅𝑦)
1710, 13, 3, 16wsuclem 34785 . . . 4 (𝜑 → ∃𝑎𝐴 (∀𝑏 ∈ Pred (𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (𝑅, 𝐴, 𝑋)𝑐𝑅𝑏)))
1812, 17inflb 9480 . . 3 (𝜑 → (𝑌 ∈ Pred(𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(𝑅, 𝐴, 𝑋), 𝐴, 𝑅)))
199, 18mpd 15 . 2 (𝜑 → ¬ 𝑌𝑅inf(Pred(𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
20 df-wsuc 34772 . . 3 wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
2120breq2i 5155 . 2 (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
2219, 21sylnibr 328 1 (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wcel 2106  wrex 3070   class class class wbr 5147   Or wor 5586   Se wse 5628   We wwe 5629  ccnv 5674  Predcpred 6296  infcinf 9432  wsuccwsuc 34770
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-po 5587  df-so 5588  df-fr 5630  df-se 5631  df-we 5632  df-xp 5681  df-cnv 5683  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-iota 6492  df-riota 7361  df-sup 9433  df-inf 9434  df-wsuc 34772
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator