Theorem nffrfor 4350

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
nffrfor.r	⊢ Ⅎ𝑥𝑅
nffrfor.a	⊢ Ⅎ𝑥𝐴
nffrfor.s	⊢ Ⅎ𝑥𝑆

Assertion

Ref	Expression
nffrfor	⊢ Ⅎ𝑥 FrFor 𝑅𝐴𝑆

Proof of Theorem nffrfor

Dummy variables 𝑢 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-frfor 4333	. 2 ⊢ ( FrFor 𝑅𝐴𝑆 ↔ (∀𝑢 ∈ 𝐴 (∀𝑣 ∈ 𝐴 (𝑣𝑅𝑢 → 𝑣 ∈ 𝑆) → 𝑢 ∈ 𝑆) → 𝐴 ⊆ 𝑆))
2		nffrfor.a	. . . 4 ⊢ Ⅎ𝑥𝐴
3		nfcv 2319	. . . . . . . 8 ⊢ Ⅎ𝑥𝑣
4		nffrfor.r	. . . . . . . 8 ⊢ Ⅎ𝑥𝑅
5		nfcv 2319	. . . . . . . 8 ⊢ Ⅎ𝑥𝑢
6	3, 4, 5	nfbr 4051	. . . . . . 7 ⊢ Ⅎ𝑥 𝑣𝑅𝑢
7		nffrfor.s	. . . . . . . 8 ⊢ Ⅎ𝑥𝑆
8	7	nfcri 2313	. . . . . . 7 ⊢ Ⅎ𝑥 𝑣 ∈ 𝑆
9	6, 8	nfim 1572	. . . . . 6 ⊢ Ⅎ𝑥(𝑣𝑅𝑢 → 𝑣 ∈ 𝑆)
10	2, 9	nfralxy 2515	. . . . 5 ⊢ Ⅎ𝑥∀𝑣 ∈ 𝐴 (𝑣𝑅𝑢 → 𝑣 ∈ 𝑆)
11	7	nfcri 2313	. . . . 5 ⊢ Ⅎ𝑥 𝑢 ∈ 𝑆
12	10, 11	nfim 1572	. . . 4 ⊢ Ⅎ𝑥(∀𝑣 ∈ 𝐴 (𝑣𝑅𝑢 → 𝑣 ∈ 𝑆) → 𝑢 ∈ 𝑆)
13	2, 12	nfralxy 2515	. . 3 ⊢ Ⅎ𝑥∀𝑢 ∈ 𝐴 (∀𝑣 ∈ 𝐴 (𝑣𝑅𝑢 → 𝑣 ∈ 𝑆) → 𝑢 ∈ 𝑆)
14	2, 7	nfss 3150	. . 3 ⊢ Ⅎ𝑥 𝐴 ⊆ 𝑆
15	13, 14	nfim 1572	. 2 ⊢ Ⅎ𝑥(∀𝑢 ∈ 𝐴 (∀𝑣 ∈ 𝐴 (𝑣𝑅𝑢 → 𝑣 ∈ 𝑆) → 𝑢 ∈ 𝑆) → 𝐴 ⊆ 𝑆)
16	1, 15	nfxfr 1474	1 ⊢ Ⅎ𝑥 FrFor 𝑅𝐴𝑆

Syntax hints:   → wi 4  Ⅎwnf 1460   ∈ wcel 2148  Ⅎwnfc 2306  ∀wral 2455   ⊆ wss 3131   class class class wbr 4005   FrFor wfrfor 4329

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2741  df-un 3135  df-in 3137  df-ss 3144  df-sn 3600  df-pr 3601  df-op 3603  df-br 4006  df-frfor 4333

This theorem is referenced by:  nffr  4351