Theorem nfpo 4218

Description: Bound-variable hypothesis builder for partial orders. (Contributed by Stefan O'Rear, 20-Jan-2015.)

Hypotheses

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

Assertion

Ref	Expression
nfpo	⊢ Ⅎ𝑥 𝑅 Po 𝐴

Proof of Theorem nfpo

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

Step	Hyp	Ref	Expression
1		df-po 4213	. 2 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)))
2		nfpo.a	. . 3 ⊢ Ⅎ𝑥𝐴
3		nfcv 2279	. . . . . . . 8 ⊢ Ⅎ𝑥𝑎
4		nfpo.r	. . . . . . . 8 ⊢ Ⅎ𝑥𝑅
5	3, 4, 3	nfbr 3969	. . . . . . 7 ⊢ Ⅎ𝑥 𝑎𝑅𝑎
6	5	nfn 1636	. . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝑎𝑅𝑎
7		nfcv 2279	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑏
8	3, 4, 7	nfbr 3969	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
9		nfcv 2279	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑐
10	7, 4, 9	nfbr 3969	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑏𝑅𝑐
11	8, 10	nfan 1544	. . . . . . 7 ⊢ Ⅎ𝑥(𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐)
12	3, 4, 9	nfbr 3969	. . . . . . 7 ⊢ Ⅎ𝑥 𝑎𝑅𝑐
13	11, 12	nfim 1551	. . . . . 6 ⊢ Ⅎ𝑥((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
14	6, 13	nfan 1544	. . . . 5 ⊢ Ⅎ𝑥(¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
15	2, 14	nfralxy 2469	. . . 4 ⊢ Ⅎ𝑥∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
16	2, 15	nfralxy 2469	. . 3 ⊢ Ⅎ𝑥∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
17	2, 16	nfralxy 2469	. 2 ⊢ Ⅎ𝑥∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
18	1, 17	nfxfr 1450	1 ⊢ Ⅎ𝑥 𝑅 Po 𝐴

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 103  Ⅎwnf 1436  Ⅎwnfc 2266  ∀wral 2414   class class class wbr 3924   Po wpo 4211

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ral 2419  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531  df-br 3925  df-po 4213

This theorem is referenced by:  nfso  4219