Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fr0 | Structured version Visualization version GIF version |
Description: Any relation is well-founded on the empty set. (Contributed by NM, 17-Sep-1993.) |
Ref | Expression |
---|---|
fr0 | ⊢ 𝑅 Fr ∅ |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dffr2 5500 | . 2 ⊢ (𝑅 Fr ∅ ↔ ∀𝑥((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅)) | |
2 | ss0 4299 | . . . . 5 ⊢ (𝑥 ⊆ ∅ → 𝑥 = ∅) | |
3 | 2 | a1d 25 | . . . 4 ⊢ (𝑥 ⊆ ∅ → (¬ ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅ → 𝑥 = ∅)) |
4 | 3 | necon1ad 2949 | . . 3 ⊢ (𝑥 ⊆ ∅ → (𝑥 ≠ ∅ → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅)) |
5 | 4 | imp 410 | . 2 ⊢ ((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅) |
6 | 1, 5 | mpgbir 1807 | 1 ⊢ 𝑅 Fr ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 = wceq 1543 ≠ wne 2932 ∃wrex 3052 {crab 3055 ⊆ wss 3853 ∅c0 4223 class class class wbr 5039 Fr wfr 5491 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-ext 2708 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-ne 2933 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-br 5040 df-fr 5494 |
This theorem is referenced by: we0 5531 frsn 5621 frfi 8894 ifr0 41682 |
Copyright terms: Public domain | W3C validator |