Theorem nffr 5605

Description: Bound-variable hypothesis builder for well-founded relations. (Contributed by Stefan O'Rear, 20-Jan-2015.) (Revised by Mario Carneiro, 14-Oct-2016.)

Hypotheses

Ref	Expression
nffr.r	⊢ Ⅎ𝑥𝑅
nffr.a	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
nffr	⊢ Ⅎ𝑥 𝑅 Fr 𝐴

Proof of Theorem nffr

Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-fr 5585	. 2 ⊢ (𝑅 Fr 𝐴 ↔ ∀𝑎((𝑎 ⊆ 𝐴 ∧ 𝑎 ≠ ∅) → ∃𝑏 ∈ 𝑎 ∀𝑐 ∈ 𝑎 ¬ 𝑐𝑅𝑏))
2		nfcv 2899	. . . . . 6 ⊢ Ⅎ𝑥𝑎
3		nffr.a	. . . . . 6 ⊢ Ⅎ𝑥𝐴
4	2, 3	nfss 3928	. . . . 5 ⊢ Ⅎ𝑥 𝑎 ⊆ 𝐴
5		nfv 1916	. . . . 5 ⊢ Ⅎ𝑥 𝑎 ≠ ∅
6	4, 5	nfan 1901	. . . 4 ⊢ Ⅎ𝑥(𝑎 ⊆ 𝐴 ∧ 𝑎 ≠ ∅)
7		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝑐
8		nffr.r	. . . . . . . 8 ⊢ Ⅎ𝑥𝑅
9		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝑏
10	7, 8, 9	nfbr 5147	. . . . . . 7 ⊢ Ⅎ𝑥 𝑐𝑅𝑏
11	10	nfn 1859	. . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝑐𝑅𝑏
12	2, 11	nfralw 3285	. . . . 5 ⊢ Ⅎ𝑥∀𝑐 ∈ 𝑎 ¬ 𝑐𝑅𝑏
13	2, 12	nfrexw 3286	. . . 4 ⊢ Ⅎ𝑥∃𝑏 ∈ 𝑎 ∀𝑐 ∈ 𝑎 ¬ 𝑐𝑅𝑏
14	6, 13	nfim 1898	. . 3 ⊢ Ⅎ𝑥((𝑎 ⊆ 𝐴 ∧ 𝑎 ≠ ∅) → ∃𝑏 ∈ 𝑎 ∀𝑐 ∈ 𝑎 ¬ 𝑐𝑅𝑏)
15	14	nfal 2329	. 2 ⊢ Ⅎ𝑥∀𝑎((𝑎 ⊆ 𝐴 ∧ 𝑎 ≠ ∅) → ∃𝑏 ∈ 𝑎 ∀𝑐 ∈ 𝑎 ¬ 𝑐𝑅𝑏)
16	1, 15	nfxfr 1855	1 ⊢ Ⅎ𝑥 𝑅 Fr 𝐴

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395  ∀wal 1540  Ⅎwnf 1785  Ⅎwnfc 2884   ≠ wne 2933  ∀wral 3052  ∃wrex 3062   ⊆ wss 3903  ∅c0 4287   class class class wbr 5100   Fr wfr 5582

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-fr 5585

This theorem is referenced by:  nfwe  5607  weiunfr  36683