![]() |
Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > wsuclb | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
wsuclb.1 | ⊢ (𝜑 → 𝑅 We 𝐴) |
wsuclb.2 | ⊢ (𝜑 → 𝑅 Se 𝐴) |
wsuclb.3 | ⊢ (𝜑 → 𝑋 ∈ 𝑉) |
wsuclb.4 | ⊢ (𝜑 → 𝑌 ∈ 𝐴) |
wsuclb.5 | ⊢ (𝜑 → 𝑋𝑅𝑌) |
Ref | Expression |
---|---|
wsuclb | ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wsuclb.5 | . . . . 5 ⊢ (𝜑 → 𝑋𝑅𝑌) | |
2 | wsuclb.4 | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐴) | |
3 | wsuclb.3 | . . . . . 6 ⊢ (𝜑 → 𝑋 ∈ 𝑉) | |
4 | brcnvg 5834 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) | |
5 | 2, 3, 4 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) |
6 | 1, 5 | mpbird 256 | . . . 4 ⊢ (𝜑 → 𝑌◡𝑅𝑋) |
7 | elpredg 6266 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) | |
8 | 3, 2, 7 | syl2anc 584 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) |
9 | 6, 8 | mpbird 256 | . . 3 ⊢ (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋)) |
10 | wsuclb.1 | . . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴) | |
11 | weso 5623 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
12 | 10, 11 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴) |
13 | wsuclb.2 | . . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴) | |
14 | breq2 5108 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌)) | |
15 | 14 | rspcev 3580 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
16 | 2, 1, 15 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
17 | 10, 13, 3, 16 | wsuclem 34292 | . . . 4 ⊢ (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏))) |
18 | 12, 17 | inflb 9422 | . . 3 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))) |
19 | 9, 18 | mpd 15 | . 2 ⊢ (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
20 | df-wsuc 34279 | . . 3 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅) | |
21 | 20 | breq2i 5112 | . 2 ⊢ (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
22 | 19, 21 | sylnibr 328 | 1 ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∈ wcel 2106 ∃wrex 3072 class class class wbr 5104 Or wor 5543 Se wse 5585 We wwe 5586 ◡ccnv 5631 Predcpred 6251 infcinf 9374 wsuccwsuc 34277 |
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 2707 ax-sep 5255 ax-nul 5262 ax-pr 5383 |
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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2888 df-ne 2943 df-ral 3064 df-rex 3073 df-rmo 3352 df-reu 3353 df-rab 3407 df-v 3446 df-sbc 3739 df-dif 3912 df-un 3914 df-in 3916 df-ss 3926 df-nul 4282 df-if 4486 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4865 df-br 5105 df-opab 5167 df-po 5544 df-so 5545 df-fr 5587 df-se 5588 df-we 5589 df-xp 5638 df-cnv 5640 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6252 df-iota 6446 df-riota 7310 df-sup 9375 df-inf 9376 df-wsuc 34279 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |