Theorem nfpo 5576

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 5570	. 2 ⊢ (𝑅 Po 𝐴 ↔ ∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)))
2		nfpo.a	. . 3 ⊢ Ⅎ𝑥𝐴
3		nfcv 2931	. . . . . . . 8 ⊢ Ⅎ𝑥𝑎
4		nfpo.r	. . . . . . . 8 ⊢ Ⅎ𝑥𝑅
5	3, 4, 3	nfbr 5162	. . . . . . 7 ⊢ Ⅎ𝑥 𝑎𝑅𝑎
6	5	nfn 1884	. . . . . 6 ⊢ Ⅎ𝑥 ¬ 𝑎𝑅𝑎
7		nfcv 2931	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑏
8	3, 4, 7	nfbr 5162	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑎𝑅𝑏
9		nfcv 2931	. . . . . . . . 9 ⊢ Ⅎ𝑥𝑐
10	7, 4, 9	nfbr 5162	. . . . . . . 8 ⊢ Ⅎ𝑥 𝑏𝑅𝑐
11	8, 10	nfan 1926	. . . . . . 7 ⊢ Ⅎ𝑥(𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐)
12	3, 4, 9	nfbr 5162	. . . . . . 7 ⊢ Ⅎ𝑥 𝑎𝑅𝑐
13	11, 12	nfim 1923	. . . . . 6 ⊢ Ⅎ𝑥((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)
14	6, 13	nfan 1926	. . . . 5 ⊢ Ⅎ𝑥(¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
15	2, 14	nfralw 3318	. . . 4 ⊢ Ⅎ𝑥∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
16	2, 15	nfralw 3318	. . 3 ⊢ Ⅎ𝑥∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
17	2, 16	nfralw 3318	. 2 ⊢ Ⅎ𝑥∀𝑎 ∈ 𝐴 ∀𝑏 ∈ 𝐴 ∀𝑐 ∈ 𝐴 (¬ 𝑎𝑅𝑎 ∧ ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐))
18	1, 17	nfxfr 1880	1 ⊢ Ⅎ𝑥 𝑅 Po 𝐴

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400  Ⅎwnf 1810  Ⅎwnfc 2916  ∀wral 3085   class class class wbr 5113   Po wpo 5568

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ral 3086  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-po 5570

This theorem is referenced by:  nfso  5577  weiunpo  36864