MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  nfopd Structured version   Visualization version   GIF version

Theorem nfopd 4850
Description: Deduction version of bound-variable hypothesis builder nfop 4849. This shows how the deduction version of a not-free theorem such as nfop 4849 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.
StepHypRef Expression
1 nfaba1 2931 . . 3 Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}
2 nfaba1 2931 . . 3 Ⅎ𝑥{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}
31, 2nfop 4849 . 2 Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩
4 nfopd.2 . . 3 (𝜑 → Ⅎ𝑥𝐴)
5 nfopd.3 . . 3 (𝜑 → Ⅎ𝑥𝐵)
6 nfnfc1 2926 . . . . 5 Ⅎ𝑥Ⅎ𝑥𝐴
7 nfnfc1 2926 . . . . 5 Ⅎ𝑥Ⅎ𝑥𝐵
86, 7nfan 1932 . . . 4 Ⅎ𝑥(Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵)
9 abidnf 3660 . . . . . 6 (Ⅎ𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
109adantr 486 . . . . 5 ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴} = 𝐴)
11 abidnf 3660 . . . . . 6 (Ⅎ𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
1211adantl 487 . . . . 5 ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵} = 𝐵)
1310, 12opeq12d 4841 . . . 4 ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → ⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ = ⟨𝐴, 𝐵⟩)
148, 13nfceqdf 2919 . . 3 ((Ⅎ𝑥𝐴 ∧ Ⅎ𝑥𝐵) → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
154, 5, 14syl2anc 596 . 2 (𝜑 → (Ⅎ𝑥⟨{𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐴}, {𝑧 ∣ ∀𝑥 𝑧 ∈ 𝐵}⟩ ↔ Ⅎ𝑥⟨𝐴, 𝐵⟩))
163, 15mpbii 236 1 (𝜑 → Ⅎ𝑥⟨𝐴, 𝐵⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  {cab 2739  Ⅎwnfc 2908  ⟨cop 4590
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591
This theorem is used by:  nfbrd  5151  dfid3  5549  nfovd  7449
  Copyright terms: Public domain W3C validator