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

Theorem intab 3665
Description: The intersection of a special case of a class abstraction. 𝑦 may be free in 𝜑 and 𝐴, which can be thought of a 𝜑(𝑦) and 𝐴(𝑦). (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 2087 . . . . . . . . . 10 (𝑧 = 𝑥 → (𝑧 = 𝐴𝑥 = 𝐴))
21anbi2d 451 . . . . . . . . 9 (𝑧 = 𝑥 → ((𝜑𝑧 = 𝐴) ↔ (𝜑𝑥 = 𝐴)))
32exbidv 1746 . . . . . . . 8 (𝑧 = 𝑥 → (∃𝑦(𝜑𝑧 = 𝐴) ↔ ∃𝑦(𝜑𝑥 = 𝐴)))
43cbvabv 2202 . . . . . . 7 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} = {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)}
5 intab.2 . . . . . . 7 {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)} ∈ V
64, 5eqeltri 2151 . . . . . 6 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ V
7 nfe1 1425 . . . . . . . . 9 𝑦𝑦(𝜑𝑧 = 𝐴)
87nfab 2223 . . . . . . . 8 𝑦{𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
98nfeq2 2230 . . . . . . 7 𝑦 𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
10 eleq2 2142 . . . . . . . 8 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → (𝐴𝑥𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}))
1110imbi2d 228 . . . . . . 7 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → ((𝜑𝐴𝑥) ↔ (𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})))
129, 11albid 1546 . . . . . 6 (𝑥 = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} → (∀𝑦(𝜑𝐴𝑥) ↔ ∀𝑦(𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})))
136, 12elab 2738 . . . . 5 ({𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ↔ ∀𝑦(𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}))
14 19.8a 1522 . . . . . . . . 9 ((𝜑𝑧 = 𝐴) → ∃𝑦(𝜑𝑧 = 𝐴))
1514ex 113 . . . . . . . 8 (𝜑 → (𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
1615alrimiv 1795 . . . . . . 7 (𝜑 → ∀𝑧(𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
17 intab.1 . . . . . . . 8 𝐴 ∈ V
1817sbc6 2840 . . . . . . 7 ([𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴) ↔ ∀𝑧(𝑧 = 𝐴 → ∃𝑦(𝜑𝑧 = 𝐴)))
1916, 18sylibr 132 . . . . . 6 (𝜑[𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴))
20 df-sbc 2816 . . . . . 6 ([𝐴 / 𝑧]𝑦(𝜑𝑧 = 𝐴) ↔ 𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2119, 20sylib 120 . . . . 5 (𝜑𝐴 ∈ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2213, 21mpgbir 1382 . . . 4 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)}
23 intss1 3651 . . . 4 ({𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ∈ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} → {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ⊆ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)})
2422, 23ax-mp 7 . . 3 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ⊆ {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
25 19.29r 1552 . . . . . . . 8 ((∃𝑦(𝜑𝑧 = 𝐴) ∧ ∀𝑦(𝜑𝐴𝑥)) → ∃𝑦((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)))
26 simplr 496 . . . . . . . . . 10 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧 = 𝐴)
27 pm3.35 339 . . . . . . . . . . 11 ((𝜑 ∧ (𝜑𝐴𝑥)) → 𝐴𝑥)
2827adantlr 460 . . . . . . . . . 10 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝐴𝑥)
2926, 28eqeltrd 2155 . . . . . . . . 9 (((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧𝑥)
3029exlimiv 1529 . . . . . . . 8 (∃𝑦((𝜑𝑧 = 𝐴) ∧ (𝜑𝐴𝑥)) → 𝑧𝑥)
3125, 30syl 14 . . . . . . 7 ((∃𝑦(𝜑𝑧 = 𝐴) ∧ ∀𝑦(𝜑𝐴𝑥)) → 𝑧𝑥)
3231ex 113 . . . . . 6 (∃𝑦(𝜑𝑧 = 𝐴) → (∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
3332alrimiv 1795 . . . . 5 (∃𝑦(𝜑𝑧 = 𝐴) → ∀𝑥(∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
34 vex 2604 . . . . . 6 𝑧 ∈ V
3534elintab 3647 . . . . 5 (𝑧 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} ↔ ∀𝑥(∀𝑦(𝜑𝐴𝑥) → 𝑧𝑥))
3633, 35sylibr 132 . . . 4 (∃𝑦(𝜑𝑧 = 𝐴) → 𝑧 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)})
3736abssi 3069 . . 3 {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)} ⊆ {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)}
3824, 37eqssi 3015 . 2 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} = {𝑧 ∣ ∃𝑦(𝜑𝑧 = 𝐴)}
3938, 4eqtri 2101 1 {𝑥 ∣ ∀𝑦(𝜑𝐴𝑥)} = {𝑥 ∣ ∃𝑦(𝜑𝑥 = 𝐴)}
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wal 1282   = wceq 1284  wex 1421  wcel 1433  {cab 2067  Vcvv 2601  [wsbc 2815  wss 2973   cint 3636
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-sbc 2816  df-in 2979  df-ss 2986  df-int 3637
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator