Theorem nfwe 4495

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

Hypotheses

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

Assertion

Ref	Expression
nfwe	⊢ Ⅎ𝑥 𝑅 We 𝐴

Proof of Theorem nfwe

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

Step	Hyp	Ref	Expression
1		df-wetr 4474	. 2 ⊢ (𝑅 We 𝐴 ↔ (𝑅 Fr 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)))
2		nfwe.r	. . . 4 ⊢ Ⅎ𝑥𝑅
3		nfwe.a	. . . 4 ⊢ Ⅎ𝑥𝐴
4	2, 3	nffr 4489	. . 3 ⊢ Ⅎ𝑥 𝑅 Fr 𝐴
5		nfcv 2392	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑎
6		nfcv 2392	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑏
7	5, 2, 6	nfbr 4172	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
8		nfcv 2392	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑐
9	6, 2, 8	nfbr 4172	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑏𝑅𝑐
10	7, 9	nfan 1618	. . . . . . 7 ⊢ Ⅎ𝑥(𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐)
11	5, 2, 8	nfbr 4172	. . . . . . 7 ⊢ Ⅎ𝑥 𝑎𝑅𝑐
12	10, 11	nfim 1625	. . . . . 6 ⊢ Ⅎ𝑥((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
13	3, 12	nfralxy 2588	. . . . 5 ⊢ Ⅎ𝑥∀𝑐 ∈ 𝐴 ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
14	3, 13	nfralxy 2588	. . . 4 ⊢ Ⅎ𝑥∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
15	3, 14	nfralxy 2588	. . 3 ⊢ Ⅎ𝑥∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
16	4, 15	nfan 1618	. 2 ⊢ Ⅎ𝑥(𝑅 Fr 𝐴 ∧ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
17	1, 16	nfxfr 1527	1 ⊢ Ⅎ𝑥 𝑅 We 𝐴

Syntax hints:   → wi 4   ∧ wa 104  Ⅎwnf 1513  Ⅎwnfc 2379  ∀wral 2528   class class class wbr 4125   Fr wfr 4468   We wwe 4470

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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220

This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-sn 3711  df-pr 3712  df-op 3714  df-br 4126  df-frfor 4471  df-frind 4472  df-wetr 4474

This theorem is referenced by: (None)