Theorem fr0 5641

Description: Any relation is well-founded on the empty set. (Contributed by NM, 17-Sep-1993.)

Assertion

Ref	Expression
fr0	⊢ 𝑅 Fr ∅

Proof of Theorem fr0

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffr2 5624	. 2 ⊢ (𝑅 Fr ∅ ↔ ∀𝑥((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅))
2		ss0 4359	. . . . 5 ⊢ (𝑥 ⊆ ∅ → 𝑥 = ∅)
3	2	a1d 26	. . . 4 ⊢ (𝑥 ⊆ ∅ → (¬ ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅ → 𝑥 = ∅))
4	3	necon1ad 2977	. . 3 ⊢ (𝑥 ⊆ ∅ → (𝑥 ≠ ∅ → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅))
5	4	imp 412	. 2 ⊢ ((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅)
6	1, 5	mpgbir 1832	1 ⊢ 𝑅 Fr ∅

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ≠ wne 2960  ∃wrex 3091  {crab 3418   ⊆ wss 3906  ∅c0 4286   class class class wbr 5111   Fr wfr 5613

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 2148  ax-9 2156  ax-ext 2737

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-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-fr 5616

This theorem is used by:  we0  5658  frsn  5751  frfi  9252  ifr0  45219