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

Theorem dffr2ALT 5587
Description: Alternate proof of dffr2 5586, which avoids ax-8 2121 but requires ax-10 2152, ax-11 2168, ax-12 2189. (Contributed by NM, 17-Feb-2004.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) (Proof shortened by Mario Carneiro, 23-Jun-2015.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
dffr2ALT (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧

Proof of Theorem dffr2ALT
StepHypRef Expression
1 df-fr 5578 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
2 rabeq0 4323 . . . . 5 ({𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∀𝑧𝑥 ¬ 𝑧𝑅𝑦)
32rexbii 3087 . . . 4 (∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
43imbi2i 337 . . 3 (((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
54albii 1826 . 2 (∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
61, 5bitr4i 279 1 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wal 1545   = wceq 1547  wne 2935  wral 3054  wrex 3064  {crab 3392  wss 3890  c0 4268   class class class wbr 5079   Fr wfr 5575
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-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-clab 2719  df-cleq 2732  df-ral 3055  df-rex 3065  df-rab 3393  df-dif 3893  df-nul 4269  df-fr 5578
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator