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

Theorem dffr2 5373
Description: Alternate definition of well-founded relation. Similar to Definition 6.21 of [TakeutiZaring] p. 30. (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof shortened by Mario Carneiro, 23-Jun-2015.)
Assertion
Ref Expression
dffr2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧

Proof of Theorem dffr2
StepHypRef Expression
1 df-fr 5367 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
2 rabeq0 4226 . . . . 5 ({𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∀𝑧𝑥 ¬ 𝑧𝑅𝑦)
32rexbii 3194 . . . 4 (∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
43imbi2i 328 . . 3 (((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
54albii 1782 . 2 (∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
61, 5bitr4i 270 1 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 387  wal 1505   = wceq 1507  wne 2967  wral 3088  wrex 3089  {crab 3092  wss 3831  c0 4180   class class class wbr 4930   Fr wfr 5364
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1965  ax-8 2052  ax-9 2059  ax-10 2079  ax-11 2093  ax-12 2106  ax-ext 2750
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2016  df-clab 2759  df-cleq 2771  df-clel 2846  df-nfc 2918  df-ral 3093  df-rex 3094  df-rab 3097  df-dif 3834  df-nul 4181  df-fr 5367
This theorem is referenced by:  fr0  5387  dfepfr  5393  dffr3  5804
  Copyright terms: Public domain W3C validator