Theorem wsuclb 36326

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 5864	. . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
5	2, 3, 4	syl2anc 595	. . . . 5 ⊢ (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌))
6	1, 5	mpbird 260	. . . 4 ⊢ (𝜑 → 𝑌◡𝑅𝑋)
7		elpredg 6316	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
8	3, 2, 7	syl2anc 595	. . . 4 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋))
9	6, 8	mpbird 260	. . 3 ⊢ (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋))
10		wsuclb.1	. . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴)
11		weso 5651	. . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴)
12	10, 11	syl 18	. . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴)
13		wsuclb.2	. . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴)
14		breq2 5112	. . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌))
15	14	rspcev 3580	. . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
16	2, 1, 15	syl2anc 595	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦)
17	10, 13, 3, 16	wsuclem 36323	. . . 4 ⊢ (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏)))
18	12, 17	inflb 9448	. . 3 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)))
19	9, 18	mpd 16	. 2 ⊢ (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
20		df-wsuc 36310	. . 3 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)
21	20	breq2i 5116	. 2 ⊢ (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))
22	19, 21	sylnibr 332	1 ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∈ wcel 2142  ∃wrex 3088   class class class wbr 5108   Or wor 5567   Se wse 5611   We wwe 5612  ^◡ccnv 5659  Predcpred 6301  infcinf 9399  wsuccwsuc 36308

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-po 5568  df-so 5569  df-fr 5613  df-se 5614  df-we 5615  df-xp 5666  df-cnv 5668  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-pred 6302  df-iota 6492  df-riota 7369  df-sup 9400  df-inf 9401  df-wsuc 36310

This theorem is used by: (None)