Theorem nfopd 4818

Description: Deduction version of bound-variable hypothesis builder nfop 4817. This shows how the deduction version of a not-free theorem such as nfop 4817 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 2914	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
2		nfaba1 2914	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
3	1, 2	nfop 4817	. 2 ⊢ Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
4		nfopd.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴)
5		nfopd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵)
6		nfnfc1 2909	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
7		nfnfc1 2909	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵
8	6, 7	nfan 1903	. . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵)
9		abidnf 3633	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
10	9	adantr 480	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
11		abidnf 3633	. . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
12	11	adantl 481	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
13	10, 12	opeq12d 4809	. . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
14	8, 13	nfceqdf 2901	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
15	4, 5, 14	syl2anc 583	. 2 ⊢ (𝜑 → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
16	3, 15	mpbii 232	1 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1537   = wceq 1539   ∈ wcel 2108  {cab 2715  Ⅎwnfc 2886  ⟨cop 4564

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565

This theorem is referenced by:  nfbrd  5116  dfid3  5483  nfovd  7284