| 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 5853 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋 ∈ 𝑉) → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) | |
| 5 | 2, 3, 4 | syl2anc 593 | . . . . 5 ⊢ (𝜑 → (𝑌◡𝑅𝑋 ↔ 𝑋𝑅𝑌)) |
| 6 | 1, 5 | mpbird 259 | . . . 4 ⊢ (𝜑 → 𝑌◡𝑅𝑋) |
| 7 | elpredg 6304 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝐴) → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) | |
| 8 | 3, 2, 7 | syl2anc 593 | . . . 4 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) ↔ 𝑌◡𝑅𝑋)) |
| 9 | 6, 8 | mpbird 259 | . . 3 ⊢ (𝜑 → 𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋)) |
| 10 | wsuclb.1 | . . . . 5 ⊢ (𝜑 → 𝑅 We 𝐴) | |
| 11 | weso 5640 | . . . . 5 ⊢ (𝑅 We 𝐴 → 𝑅 Or 𝐴) | |
| 12 | 10, 11 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑅 Or 𝐴) |
| 13 | wsuclb.2 | . . . . 5 ⊢ (𝜑 → 𝑅 Se 𝐴) | |
| 14 | breq2 5106 | . . . . . . 7 ⊢ (𝑦 = 𝑌 → (𝑋𝑅𝑦 ↔ 𝑋𝑅𝑌)) | |
| 15 | 14 | rspcev 3583 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐴 ∧ 𝑋𝑅𝑌) → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
| 16 | 2, 1, 15 | syl2anc 593 | . . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ 𝐴 𝑋𝑅𝑦) |
| 17 | 10, 13, 3, 16 | wsuclem 36178 | . . . 4 ⊢ (𝜑 → ∃𝑎 ∈ 𝐴 (∀𝑏 ∈ Pred (◡𝑅, 𝐴, 𝑋) ¬ 𝑏𝑅𝑎 ∧ ∀𝑏 ∈ 𝐴 (𝑎𝑅𝑏 → ∃𝑐 ∈ Pred (◡𝑅, 𝐴, 𝑋)𝑐𝑅𝑏))) |
| 18 | 12, 17 | inflb 9438 | . . 3 ⊢ (𝜑 → (𝑌 ∈ Pred(◡𝑅, 𝐴, 𝑋) → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅))) |
| 19 | 9, 18 | mpd 15 | . 2 ⊢ (𝜑 → ¬ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
| 20 | df-wsuc 36165 | . . 3 ⊢ wsuc(𝑅, 𝐴, 𝑋) = inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅) | |
| 21 | 20 | breq2i 5110 | . 2 ⊢ (𝑌𝑅wsuc(𝑅, 𝐴, 𝑋) ↔ 𝑌𝑅inf(Pred(◡𝑅, 𝐴, 𝑋), 𝐴, 𝑅)) |
| 22 | 19, 21 | sylnibr 331 | 1 ⊢ (𝜑 → ¬ 𝑌𝑅wsuc(𝑅, 𝐴, 𝑋)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∈ wcel 2144 ∃wrex 3088 class class class wbr 5102 Or wor 5556 Se wse 5600 We wwe 5601 ◡ccnv 5648 Predcpred 6289 infcinf 9389 wsuccwsuc 36163 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-ne 2960 df-ral 3079 df-rex 3089 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3458 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-po 5557 df-so 5558 df-fr 5602 df-se 5603 df-we 5604 df-xp 5655 df-cnv 5657 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-pred 6290 df-iota 6479 df-riota 7355 df-sup 9390 df-inf 9391 df-wsuc 36165 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |