Theorem nfopd 3717

Description: Deduction version of bound-variable hypothesis builder nfop 3716. This shows how the deduction version of a not-free theorem such as nfop 3716 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 2285	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
2		nfaba1 2285	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
3	1, 2	nfop 3716	. 2 ⊢ Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
4		nfopd.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴)
5		nfopd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵)
6		nfnfc1 2282	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
7		nfnfc1 2282	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵
8	6, 7	nfan 1544	. . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵)
9		abidnf 2847	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
10	9	adantr 274	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
11		abidnf 2847	. . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
12	11	adantl 275	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
13	10, 12	opeq12d 3708	. . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
14	8, 13	nfceqdf 2278	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
15	4, 5, 14	syl2anc 408	. 2 ⊢ (𝜑 → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
16	3, 15	mpbii 147	1 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1329   = wceq 1331   ∈ wcel 1480  {cab 2123  Ⅎwnfc 2266  ⟨cop 3525

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-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-nf 1437  df-sb 1736  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-v 2683  df-un 3070  df-sn 3528  df-pr 3529  df-op 3531

This theorem is referenced by:  nfbrd  3968  nfovd  5793