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 5303 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) | |
5 | 2, 3, 4 | syl2anc 693 | . . . . 5 ⊢ (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) |
6 | 1, 5 | mpbird 247 | . . . 4 ⊢ (𝜑 → 𝑌◡𝑅𝑋) |
7 | elpredg 5694 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) | |
8 | 3, 2, 7 | syl2anc 693 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) |
9 | 6, 8 | mpbird 247 | . . 3 ⊢ (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋)) |
10 | wsuclb.1 | . . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴) | |
11 | weso 5105 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
12 | 10, 11 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴) |
13 | wsuclb.2 | . . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴) | |
14 | breq2 4657 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌)) | |
15 | 14 | rspcev 3309 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
16 | 2, 1, 15 | syl2anc 693 | . . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
17 | 10, 13, 3, 16 | wsuclem 31773 | . . . 4 ⊢ (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏))) |
18 | 12, 17 | inflb 8395 | . . 3 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))) |
19 | 9, 18 | mpd 15 | . 2 ⊢ (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
20 | df-wsuc 31756 | . . 3 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅) | |
21 | 20 | breq2i 4661 | . 2 ⊢ (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
22 | 19, 21 | sylnibr 319 | 1 ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∈ wcel 1990 ∃wrex 2913 class class class wbr 4653 Or wor 5034 Se wse 5071 We wwe 5072 ◡ccnv 5113 Predcpred 5679 infcinf 8347 wsuccwsuc 31752 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-opab 4713 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-cnv 5122 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-iota 5851 df-riota 6611 df-sup 8348 df-inf 8349 df-wsuc 31756 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |