Theorem nfopd 3587

Description: Deduction version of bound-variable hypothesis builder nfop 3586. This shows how the deduction version of a not-free theorem such as nfop 3586 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 2224	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
2		nfaba1 2224	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
3	1, 2	nfop 3586	. 2 ⊢ Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
4		nfopd.2	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐴)
5		nfopd.3	. . 3 ⊢ (𝜑 → Ⅎ𝑥𝐵)
6		nfnfc1 2222	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐴
7		nfnfc1 2222	. . . . 5 ⊢ Ⅎ𝑥Ⅎ𝑥𝐵
8	6, 7	nfan 1497	. . . 4 ⊢ Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵)
9		abidnf 2760	. . . . . 6 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
10	9	adantr 270	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
11		abidnf 2760	. . . . . 6 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
12	11	adantl 271	. . . . 5 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
13	10, 12	opeq12d 3578	. . . 4 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
14	8, 13	nfceqdf 2218	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
15	4, 5, 14	syl2anc 403	. 2 ⊢ (𝜑 → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
16	3, 15	mpbii 146	1 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Syntax hints:   → wi 4   ∧ wa 102   ↔ wb 103  ∀wal 1282   = wceq 1284   ∈ wcel 1433  {cab 2067  Ⅎwnfc 2206  ⟨cop 3401

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-sn 3404  df-pr 3405  df-op 3407

This theorem is referenced by:  nfbrd  3828  nfovd  5554