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 36768
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 5864 . . . . . 6 ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
52, 3, 4syl2anc 596 . . . . 5 (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
61, 5mpbird 260 . . . 4 (𝜑 → 𝑌◡𝑅𝑋)
7 elpredg 6336 . . . . 5 ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
83, 2, 7syl2anc 596 . . . 4 (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
96, 8mpbird 260 . . 3 (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋))
10 wsuclb.1 . . . . 5 (𝜑 → 𝑅 We 𝐴)
11 weso 5646 . . . . 5 (𝑅 We 𝐴 → 𝑅 Or 𝐴)
1210, 11syl 18 . . . 4 (𝜑 → 𝑅 Or 𝐴)
13 wsuclb.2 . . . . 5 (𝜑 → 𝑅 Se 𝐴)
14 breq2 5110 . . . . . . 7 (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌))
1514rspcev 3580 . . . . . 6 ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
162, 1, 15syl2anc 596 . . . . 5 (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
1710, 13, 3, 16wsuclem 36765 . . . 4 (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏)))
1812, 17inflb 9509 . . 3 (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)))
199, 18mpd 16 . 2 (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
20 df-wsuc 36752 . . 3 wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
2120breq2i 5114 . 2 (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
2219, 21sylnibr 332 1 (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∈ wcel 2147  ∃wrex 3090   class class class wbr 5106   Or wor 5562   Se wse 5606   We wwe 5607  ◡ccnv 5654  Predcpred 6321  infcinf 9460  wsuccwsuc 36750
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-cnv 5663  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-iota 6512  df-riota 7400  df-sup 9461  df-inf 9462  df-wsuc 36752
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator