MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fr0 Structured version   Visualization version   GIF version

Theorem fr0 5596
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.
StepHypRef Expression
1 dffr2 5579 . 2 (𝑅 Fr ∅ ↔ ∀𝑥((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
2 ss0 4330 . . . . 5 (𝑥 ⊆ ∅ → 𝑥 = ∅)
32a1d 25 . . . 4 (𝑥 ⊆ ∅ → (¬ ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅ → 𝑥 = ∅))
43necon1ad 2951 . . 3 (𝑥 ⊆ ∅ → (𝑥 ≠ ∅ → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
54imp 407 . 2 ((𝑥 ⊆ ∅ ∧ 𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅)
61, 5mpgbir 1806 1 𝑅 Fr ∅
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1547  wne 2934  wrex 3063  {crab 3391  wss 3883  c0 4261   class class class wbr 5072   Fr wfr 5568
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-fr 5571
This theorem is referenced by:  we0  5613  frsn  5706  frfi  9185  ifr0  44893
  Copyright terms: Public domain W3C validator