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

Theorem dffr2 5553
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.) Avoid ax-10 2137, ax-11 2154, ax-12 2171, but use ax-8 2108. (Revised by Gino Giotto, 3-Oct-2024.)
Assertion
Ref Expression
dffr2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧

Proof of Theorem dffr2
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 df-fr 5544 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑤𝑥 ¬ 𝑤𝑅𝑦))
2 breq1 5077 . . . . . 6 (𝑧 = 𝑤 → (𝑧𝑅𝑦𝑤𝑅𝑦))
32rabeq0w 4317 . . . . 5 ({𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∀𝑤𝑥 ¬ 𝑤𝑅𝑦)
43rexbii 3181 . . . 4 (∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∃𝑦𝑥𝑤𝑥 ¬ 𝑤𝑅𝑦)
54imbi2i 336 . . 3 (((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑤𝑥 ¬ 𝑤𝑅𝑦))
65albii 1822 . 2 (∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑤𝑥 ¬ 𝑤𝑅𝑦))
71, 6bitr4i 277 1 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  wal 1537   = wceq 1539  wne 2943  wral 3064  wrex 3065  {crab 3068  wss 3887  c0 4256   class class class wbr 5074   Fr wfr 5541
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-fr 5544
This theorem is referenced by:  fr0  5568  dfepfr  5574  dffr3  6007
  Copyright terms: Public domain W3C validator