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

Theorem intab 4897
Description: The intersection of a special case of a class abstraction. 𝑦 may be free in 𝜑 and 𝐴, which can be thought of a 𝜑(𝑦) and 𝐴(𝑦). Typically, abrexex2 7659 or abexssex 7660 can be used to satisfy the second hypothesis. (Contributed by NM, 28-Jul-2006.) (Proof shortened by Mario Carneiro, 14-Nov-2016.)
Hypotheses
Ref Expression
intab.1 𝐴 ∈ V
intab.2 {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)} ∈ V
Assertion
Ref Expression
intab {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} = {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)}
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑦)   𝐴(𝑦)

Proof of Theorem intab
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqeq1 2822 . . . . . . . . . 10 (𝑧 = 𝑥 → (𝑧 = 𝐴𝑥 = 𝐴))
21anbi2d 628 . . . . . . . . 9 (𝑧 = 𝑥 → ((𝜑𝑧 = 𝐴) ↔ (𝜑𝑥 = 𝐴)))
32exbidv 1913 . . . . . . . 8 (𝑧 = 𝑥 → (∃𝑦(𝜑𝑧 = 𝐴) ↔ ∃𝑦(𝜑𝑥 = 𝐴)))
43cbvabv 2886 . . . . . . 7 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} = {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)}
5 intab.2 . . . . . . 7 {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)} ∈ V
64, 5eqeltri 2906 . . . . . 6 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ V
7 nfe1 2145 . . . . . . . . 9 𝑦𝑦(𝜑𝑧 = 𝐴)
87nfab 2981 . . . . . . . 8 𝑦{𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
98nfeq2 2992 . . . . . . 7 𝑦 𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
10 eleq2 2898 . . . . . . . 8 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → (𝐴𝑥𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}))
1110imbi2d 342 . . . . . . 7 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → ((𝜑𝐴𝑥) ↔ (𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})))
129, 11albid 2214 . . . . . 6 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → (∀𝑦(𝜑𝐴𝑥) ↔ ∀𝑦(𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})))
136, 12elab 3664 . . . . 5 ({𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ↔ ∀𝑦(𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}))
14 19.8a 2170 . . . . . . . . 9 ((𝜑𝑧 = 𝐴) → ∃𝑦(𝜑𝑧 = 𝐴))
1514ex 413 . . . . . . . 8 (𝜑 → (𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
1615alrimiv 1919 . . . . . . 7 (𝜑 → ∀𝑧(𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
17 intab.1 . . . . . . . 8 𝐴 ∈ V
1817sbc6 3799 . . . . . . 7 ([𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴) ↔ ∀𝑧(𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
1916, 18sylibr 235 . . . . . 6 (𝜑[𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴))
20 df-sbc 3770 . . . . . 6 ([𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴) ↔ 𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2119, 20sylib 219 . . . . 5 (𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2213, 21mpgbir 1791 . . . 4 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)}
23 intss1 4882 . . . 4 ({𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} → {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ⊆ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2422, 23ax-mp 5 . . 3 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ⊆ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
25 19.29r 1866 . . . . . . . 8 ((∃𝑦(𝜑𝑧 = 𝐴) ∧ ∀𝑦(𝜑𝐴𝑥)) → ∃𝑦((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)))
26 simplr 765 . . . . . . . . . 10 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧 = 𝐴)
27 pm3.35 799 . . . . . . . . . . 11 ((𝜑 ∧ (𝜑𝐴𝑥)) → 𝐴𝑥)
2827adantlr 711 . . . . . . . . . 10 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝐴𝑥)
2926, 28eqeltrd 2910 . . . . . . . . 9 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧𝑥)
3029exlimiv 1922 . . . . . . . 8 (∃𝑦((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧𝑥)
3125, 30syl 17 . . . . . . 7 ((∃𝑦(𝜑𝑧 = 𝐴) ∧ ∀𝑦(𝜑𝐴𝑥)) → 𝑧𝑥)
3231ex 413 . . . . . 6 (∃𝑦(𝜑𝑧 = 𝐴) → (∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
3332alrimiv 1919 . . . . 5 (∃𝑦(𝜑𝑧 = 𝐴) → ∀𝑥(∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
34 vex 3495 . . . . . 6 𝑧 ∈ V
3534elintab 4878 . . . . 5 (𝑧 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ↔ ∀𝑥(∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
3633, 35sylibr 235 . . . 4 (∃𝑦(𝜑𝑧 = 𝐴) → 𝑧 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)})
3736abssi 4043 . . 3 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ⊆ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)}
3824, 37eqssi 3980 . 2 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
3938, 4eqtri 2841 1 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} = {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)}
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  wal 1526   = wceq 1528  wex 1771  wcel 2105  {cab 2796  Vcvv 3492  [wsbc 3769  wss 3933   cint 4867
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-v 3494  df-sbc 3770  df-in 3940  df-ss 3949  df-int 4868
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator