| 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 9734 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 6342 | . 2 ⊢ (((𝑅 Fr 𝐴 ∧ 𝑅 Po 𝐴 ∧ 𝑅 Se 𝐴) ∧ (𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅)) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 2 | vex 3457 | . . . . . 6 ⊢ 𝑥 ∈ V | |
| 3 | 2 | dfpred3 6314 | . . . . 5 ⊢ Pred(𝑅, 𝐵, 𝑥) = {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} |
| 4 | 3 | eqeq1i 2767 | . . . 4 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ {𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅) |
| 5 | rabeq0 4341 | . . . 4 ⊢ ({𝑦 ∈ 𝐵 ∣ 𝑦𝑅𝑥} = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) | |
| 6 | 4, 5 | bitri 278 | . . 3 ⊢ (Pred(𝑅, 𝐵, 𝑥) = ∅ ↔ ∀𝑦 ∈ 𝐵 ¬ 𝑦𝑅𝑥) |
| 7 | 6 | rexbii 3111 | . 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 2957 ∀wral 3078 ∃wrex 3088 {crab 3414 ⊆ wss 3902 ∅c0 4282 class class class wbr 5107 Po wpo 5565 Fr wfr 5609 Se wse 5610 Predcpred 6302 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| 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 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-po 5567 df-fr 5612 df-se 5613 df-xp 5665 df-cnv 5667 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 |
| This theorem is used by: frpoind 6344 tz6.26 6349 fpr1 8305 |
| Copyright terms: Public domain | W3C validator |