Theorem nfopdALT 38475

Description: Deduction version of bound-variable hypothesis builder nfop 4894. This shows how the deduction version of a not-free theorem such as nfop 4894 can be created from the corresponding not-free inference theorem. (Contributed by NM, 19-Nov-2020.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
nfopdALT.1	⊢ (𝜑 → Ⅎ𝑥𝐴)
nfopdALT.2	⊢ (𝜑 → Ⅎ𝑥𝐵)

Assertion

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

Proof of Theorem nfopdALT

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfopdALT.1	. 2 ⊢ (𝜑 → Ⅎ𝑥𝐴)
2		nfopdALT.2	. 2 ⊢ (𝜑 → Ⅎ𝑥𝐵)
3		abidnf 3699	. . . 4 ⊢ (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
4	3	adantr 479	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
5		abidnf 3699	. . . 4 ⊢ (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
6	5	adantl 480	. . 3 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
7	4, 6	opeq12d 4886	. 2 ⊢ ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
8		nfaba1 2907	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
9		nfaba1 2907	. . 3 ⊢ Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
10	8, 9	nfop 4894	. 2 ⊢ Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
11	1, 2, 7, 10	nfded2 38472	1 ⊢ (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)

Syntax hints:   → wi 4   ∧ wa 394  ∀wal 1531   = wceq 1533   ∈ wcel 2098  {cab 2705  Ⅎwnfc 2879  ⟨cop 4638

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-rab 3431  df-v 3475  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4327  df-if 4533  df-sn 4633  df-pr 4635  df-op 4639

This theorem is referenced by: (None)