Theorem dffr2 5599

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 2142, ax-11 2158, ax-12 2178, but use ax-8 2111. (Revised by GG, 3-Oct-2024.)

Assertion

Ref	Expression
dffr2	⊢ (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝑅,𝑦,𝑧

Proof of Theorem dffr2

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-fr 5591	. 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑤 ∈ 𝑥 ¬ 𝑤𝑅𝑦))
2		breq1 5110	. . . . . 6 ⊢ (𝑧 = 𝑤 → (𝑧𝑅𝑦 ↔ 𝑤𝑅𝑦))
3	2	rabeq0w 4350	. . . . 5 ⊢ ({𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅ ↔ ∀𝑤 ∈ 𝑥 ¬ 𝑤𝑅𝑦)
4	3	rexbii 3076	. . . 4 ⊢ (∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅ ↔ ∃𝑦 ∈ 𝑥 ∀𝑤 ∈ 𝑥 ¬ 𝑤𝑅𝑦)
5	4	imbi2i 336	. . 3 ⊢ (((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅) ↔ ((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑤 ∈ 𝑥 ¬ 𝑤𝑅𝑦))
6	5	albii 1819	. 2 ⊢ (∀𝑥((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅) ↔ ∀𝑥((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 ∀𝑤 ∈ 𝑥 ¬ 𝑤𝑅𝑦))
7	1, 6	bitr4i 278	1 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑥((𝑥 ⊆ 𝐴 ∧ 𝑥 ≠ ∅) → ∃𝑦 ∈ 𝑥 {𝑧 ∈ 𝑥 ∣ 𝑧𝑅𝑦} = ∅))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395  ∀wal 1538   = wceq 1540   ≠ wne 2925  ∀wral 3044  ∃wrex 3053  {crab 3405   ⊆ wss 3914  ∅c0 4296   class class class wbr 5107   Fr wfr 5588

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-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-fr 5591

This theorem is referenced by:  fr0  5616  dfepfr  5622  dffr3  6070