Theorem nfopd 3884

Description: Deduction version of bound-variable hypothesis builder nfop 3883. This shows how the deduction version of a not-free theorem such as nfop 3883 can be created from the corresponding not-free inference theorem. (Contributed by NM, 4-Feb-2008.)

Hypotheses

Ref	Expression
nfopd.2	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfopd.3	⊢ (𝜑 → Ⅎ𝑥𝐵)

Assertion

Ref	Expression
nfopd	⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Proof of Theorem nfopd

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfaba1 2381	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
2		nfaba1 2381	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
3	1, 2	nfop 3883	. 2 ⊢ Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
4		nfopd.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴)
5		nfopd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵)
6		nfnfc1 2378	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
7		nfnfc1 2378	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵
8	6, 7	nfan 1614	. . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵)
9		abidnf 2975	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
10	9	adantr 276	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
11		abidnf 2975	. . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
12	11	adantl 277	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
13	10, 12	opeq12d 3875	. . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
14	8, 13	nfceqdf 2374	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
15	4, 5, 14	syl2anc 411	. 2 ⊢ (𝜑 → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
16	3, 15	mpbii 148	1 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1396   = wceq 1398   ∈ wcel 2202  {cab 2217  Ⅎwnfc 2362  ⟨cop 3676

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-v 2805  df-un 3205  df-sn 3679  df-pr 3680  df-op 3682

This theorem is referenced by:  nfbrd  4139  nfovd  6057