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

Theorem dffr2ALT 5621
Description: Alternate proof of dffr2 5620, which avoids ax-8 2111 but requires ax-10 2142, ax-11 2158, ax-12 2178. (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 5611 . 2 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
2 rabeq0 4368 . . . . 5 ({𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∀𝑧𝑥 ¬ 𝑧𝑅𝑦)
32rexbii 3084 . . . 4 (∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅ ↔ ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦)
43imbi2i 336 . . 3 (((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
54albii 1819 . 2 (∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅) ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥𝑧𝑥 ¬ 𝑧𝑅𝑦))
61, 5bitr4i 278 1 (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥𝐴𝑥 ≠ ∅) → ∃𝑦𝑥 {𝑧𝑥𝑧𝑅𝑦} = ∅))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  wal 1538   = wceq 1540  wne 2933  wral 3052  wrex 3061  {crab 3420  wss 3931  c0 4313   class class class wbr 5124   Fr wfr 5608
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2715  df-cleq 2728  df-ral 3053  df-rex 3062  df-rab 3421  df-dif 3934  df-nul 4314  df-fr 5611
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator