Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  nffvd GIF version

Theorem nffvd 5215
 Description: Deduction version of bound-variable hypothesis builder nffv 5213. (Contributed by NM, 10-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
nffvd.2 (𝜑𝑥𝐹)
nffvd.3 (𝜑𝑥𝐴)
Assertion
Ref Expression
nffvd (𝜑𝑥(𝐹𝐴))

Proof of Theorem nffvd
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfaba1 2199 . . 3 𝑥{𝑧 ∣ ∀𝑥 𝑧𝐹}
2 nfaba1 2199 . . 3 𝑥{𝑧 ∣ ∀𝑥 𝑧𝐴}
31, 2nffv 5213 . 2 𝑥({𝑧 ∣ ∀𝑥 𝑧𝐹}‘{𝑧 ∣ ∀𝑥 𝑧𝐴})
4 nffvd.2 . . 3 (𝜑𝑥𝐹)
5 nffvd.3 . . 3 (𝜑𝑥𝐴)
6 nfnfc1 2197 . . . . 5 𝑥𝑥𝐹
7 nfnfc1 2197 . . . . 5 𝑥𝑥𝐴
86, 7nfan 1473 . . . 4 𝑥(𝑥𝐹𝑥𝐴)
9 abidnf 2732 . . . . . 6 (𝑥𝐹 → {𝑧 ∣ ∀𝑥 𝑧𝐹} = 𝐹)
109adantr 265 . . . . 5 ((𝑥𝐹𝑥𝐴) → {𝑧 ∣ ∀𝑥 𝑧𝐹} = 𝐹)
11 abidnf 2732 . . . . . 6 (𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧𝐴} = 𝐴)
1211adantl 266 . . . . 5 ((𝑥𝐹𝑥𝐴) → {𝑧 ∣ ∀𝑥 𝑧𝐴} = 𝐴)
1310, 12fveq12d 5212 . . . 4 ((𝑥𝐹𝑥𝐴) → ({𝑧 ∣ ∀𝑥 𝑧𝐹}‘{𝑧 ∣ ∀𝑥 𝑧𝐴}) = (𝐹𝐴))
148, 13nfceqdf 2193 . . 3 ((𝑥𝐹𝑥𝐴) → (𝑥({𝑧 ∣ ∀𝑥 𝑧𝐹}‘{𝑧 ∣ ∀𝑥 𝑧𝐴}) ↔ 𝑥(𝐹𝐴)))
154, 5, 14syl2anc 397 . 2 (𝜑 → (𝑥({𝑧 ∣ ∀𝑥 𝑧𝐹}‘{𝑧 ∣ ∀𝑥 𝑧𝐴}) ↔ 𝑥(𝐹𝐴)))
163, 15mpbii 140 1 (𝜑𝑥(𝐹𝐴))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 101   ↔ wb 102  ∀wal 1257   = wceq 1259   ∈ wcel 1409  {cab 2042  Ⅎwnfc 2181  ‘cfv 4930 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-rex 2329  df-v 2576  df-un 2950  df-sn 3409  df-pr 3410  df-op 3412  df-uni 3609  df-br 3793  df-iota 4895  df-fv 4938 This theorem is referenced by:  nfovd  5562
 Copyright terms: Public domain W3C validator