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 5520 | . 2 ⊢ (𝑅 Fr ∅ ↔ ∀𝑥((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅)) | |
2 | ss0 4352 | . . . . 5 ⊢ (𝑥 ⊆ ∅ → 𝑥 = ∅) | |
3 | 2 | a1d 25 | . . . 4 ⊢ (𝑥 ⊆ ∅ → (¬ ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅ → 𝑥 = ∅)) |
4 | 3 | necon1ad 3033 | . . 3 ⊢ (𝑥 ⊆ ∅ → (𝑥 ≠ ∅ → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅)) |
5 | 4 | imp 409 | . 2 ⊢ ((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅) |
6 | 1, 5 | mpgbir 1800 | 1 ⊢ 𝑅 Fr ∅ |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 = wceq 1537 ≠ wne 3016 ∃wrex 3139 {crab 3142 ⊆ wss 3936 ∅c0 4291 class class class wbr 5066 Fr wfr 5511 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-dif 3939 df-in 3943 df-ss 3952 df-nul 4292 df-fr 5514 |
This theorem is referenced by: we0 5550 frsn 5639 frfi 8763 ifr0 40802 |
Copyright terms: Public domain | W3C validator |