Theorem wsuclb 36591

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.

Step	Hyp	Ref	Expression
1		wsuclb.5	. . . . 5 ⊢ (𝜑 → 𝑋𝑅𝑌)
2		wsuclb.4	. . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐴)
3		wsuclb.3	. . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉)
4		brcnvg 5857	. . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
5	2, 3, 4	syl2anc 596	. . . . 5 ⊢ (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
6	1, 5	mpbird 260	. . . 4 ⊢ (𝜑 → 𝑌◡𝑅𝑋)
7		elpredg 6319	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
8	3, 2, 7	syl2anc 596	. . . 4 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
9	6, 8	mpbird 260	. . 3 ⊢ (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋))
10		wsuclb.1	. . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴)
11		weso 5642	. . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴)
12	10, 11	syl 18	. . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴)
13		wsuclb.2	. . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴)
14		breq2 5107	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌))
15	14	rspcev 3577	. . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
16	2, 1, 15	syl2anc 596	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
17	10, 13, 3, 16	wsuclem 36588	. . . 4 ⊢ (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏)))
18	12, 17	inflb 9483	. . 3 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)))
19	9, 18	mpd 16	. 2 ⊢ (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
20		df-wsuc 36575	. . 3 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
21	20	breq2i 5111	. 2 ⊢ (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
22	19, 21	sylnibr 332	1 ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∈ wcel 2145  ∃wrex 3087   class class class wbr 5103   Or wor 5558   Se wse 5602   We wwe 5603  ^◡ccnv 5650  Predcpred 6304  infcinf 9434  wsuccwsuc 36573

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3900  df-un 3902  df-in 3904  df-ss 3915  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6305  df-iota 6495  df-riota 7378  df-sup 9435  df-inf 9436  df-wsuc 36575

This theorem is used by: (None)