| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frpomin2 | Structured version Visualization version GIF version | ||
| Description: Every nonempty (possibly proper) subclass of a class 𝐴 with a well-founded set-like partial order 𝑅 has a minimal element. The additional condition of partial order over frmin 9731 enables avoiding the axiom of infinity. (Contributed by Scott Fenton, 11-Feb-2022.) |
| Ref | Expression |
|---|---|
| frpomin2 | ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frpomin 6332 | . 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 2 | vex 3454 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | 2 | dfpred3 6304 | . . . . 5 ⊢ Pred(𝑅, 𝐵, 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} |
| 4 | 3 | eqeq1i 2765 | . . . 4 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅) |
| 5 | rabeq0 4337 | . . . 4 ⊢ ({𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 6 | 4, 5 | bitri 278 | . . 3 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 7 | 6 | rexbii 3109 | . 2 ⊢ (∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 8 | 1, 7 | sylibr 237 | 1 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 Pred(𝑅, 𝐵, 𝑥) = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ≠ wne 2955 ∀wral 3076 ∃wrex 3086 {crab 3412 ⊆ wss 3898 ∅c0 4278 class class class wbr 5102 Po wpo 5553 Fr wfr 5597 Se wse 5598 Predcpred 6292 |
| 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 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-po 5555 df-fr 5600 df-se 5601 df-xp 5653 df-cnv 5655 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6293 |
| This theorem is used by: frpoind 6334 tz6.26 6339 fpr1 8299 |
| Copyright terms: Public domain | W3C validator |