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

 Description: Deduction version of bound-variable hypothesis builder nfima 4897. (Contributed by FL, 15-Dec-2006.) (Revised by Mario Carneiro, 15-Oct-2016.)
Hypotheses
Ref Expression
Assertion
Ref Expression

Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 nfaba1 2288 . . 3 𝑥{𝑧 ∣ ∀𝑥 𝑧𝐴}
2 nfaba1 2288 . . 3 𝑥{𝑧 ∣ ∀𝑥 𝑧𝐵}
31, 2nfima 4897 . 2 𝑥({𝑧 ∣ ∀𝑥 𝑧𝐴} “ {𝑧 ∣ ∀𝑥 𝑧𝐵})
4 nfimad.2 . . 3 (𝜑𝑥𝐴)
5 nfimad.3 . . 3 (𝜑𝑥𝐵)
6 nfnfc1 2285 . . . . 5 𝑥𝑥𝐴
7 nfnfc1 2285 . . . . 5 𝑥𝑥𝐵
86, 7nfan 1545 . . . 4 𝑥(𝑥𝐴𝑥𝐵)
9 abidnf 2856 . . . . . 6 (𝑥𝐴 → {𝑧 ∣ ∀𝑥 𝑧𝐴} = 𝐴)
109imaeq1d 4888 . . . . 5 (𝑥𝐴 → ({𝑧 ∣ ∀𝑥 𝑧𝐴} “ {𝑧 ∣ ∀𝑥 𝑧𝐵}) = (𝐴 “ {𝑧 ∣ ∀𝑥 𝑧𝐵}))
11 abidnf 2856 . . . . . 6 (𝑥𝐵 → {𝑧 ∣ ∀𝑥 𝑧𝐵} = 𝐵)
1211imaeq2d 4889 . . . . 5 (𝑥𝐵 → (𝐴 “ {𝑧 ∣ ∀𝑥 𝑧𝐵}) = (𝐴𝐵))
1310, 12sylan9eq 2193 . . . 4 ((𝑥𝐴𝑥𝐵) → ({𝑧 ∣ ∀𝑥 𝑧𝐴} “ {𝑧 ∣ ∀𝑥 𝑧𝐵}) = (𝐴𝐵))
148, 13nfceqdf 2281 . . 3 ((𝑥𝐴𝑥𝐵) → (𝑥({𝑧 ∣ ∀𝑥 𝑧𝐴} “ {𝑧 ∣ ∀𝑥 𝑧𝐵}) ↔ 𝑥(𝐴𝐵)))
154, 5, 14syl2anc 409 . 2 (𝜑 → (𝑥({𝑧 ∣ ∀𝑥 𝑧𝐴} “ {𝑧 ∣ ∀𝑥 𝑧𝐵}) ↔ 𝑥(𝐴𝐵)))
163, 15mpbii 147 1 (𝜑𝑥(𝐴𝐵))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 103   ↔ wb 104  ∀wal 1330   ∈ wcel 1481  {cab 2126  Ⅎwnfc 2269   “ cima 4550 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122 This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-rab 2426  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-xp 4553  df-cnv 4555  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator