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

Theorem intabs 5310
Description: Absorption of a redundant conjunct in the intersection of a class abstraction. (Contributed by NM, 3-Jul-2005.)
Hypotheses
Ref Expression
intabs.1 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
intabs.2 (𝑥 = ∩ {𝑦 ∣ 𝜓} → (𝜑 ↔ 𝜒))
intabs.3 (∩ {𝑦 ∣ 𝜓} ⊆ 𝐴 ∧ 𝜒)
Assertion
Ref Expression
intabs ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} = ∩ {𝑥 ∣ 𝜑}
Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝜑,𝑦   𝜓,𝑥   𝜒,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦)   𝜒(𝑦)   𝐴(𝑦)

Proof of Theorem intabs
StepHypRef Expression
1 sseq1 3956 . . . . . 6 (𝑥 = ∩ {𝑦 ∣ 𝜓} → (𝑥 ⊆ 𝐴 ↔ ∩ {𝑦 ∣ 𝜓} ⊆ 𝐴))
2 intabs.2 . . . . . 6 (𝑥 = ∩ {𝑦 ∣ 𝜓} → (𝜑 ↔ 𝜒))
31, 2anbi12d 644 . . . . 5 (𝑥 = ∩ {𝑦 ∣ 𝜓} → ((𝑥 ⊆ 𝐴 ∧ 𝜑) ↔ (∩ {𝑦 ∣ 𝜓} ⊆ 𝐴 ∧ 𝜒)))
4 intabs.3 . . . . 5 (∩ {𝑦 ∣ 𝜓} ⊆ 𝐴 ∧ 𝜒)
53, 4intmin3 4936 . . . 4 (∩ {𝑦 ∣ 𝜓} ∈ V → ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑦 ∣ 𝜓})
6 intnex 5306 . . . . 5 (¬ ∩ {𝑦 ∣ 𝜓} ∈ V ↔ ∩ {𝑦 ∣ 𝜓} = V)
7 ssv 3955 . . . . . 6 ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ V
8 sseq2 3957 . . . . . 6 (∩ {𝑦 ∣ 𝜓} = V → (∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑦 ∣ 𝜓} ↔ ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ V))
97, 8mpbiri 261 . . . . 5 (∩ {𝑦 ∣ 𝜓} = V → ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑦 ∣ 𝜓})
106, 9sylbi 220 . . . 4 (¬ ∩ {𝑦 ∣ 𝜓} ∈ V → ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑦 ∣ 𝜓})
115, 10pm2.61i 184 . . 3 ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑦 ∣ 𝜓}
12 intabs.1 . . . . 5 (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
1312cbvabv 2831 . . . 4 {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓}
1413inteqi 4911 . . 3 ∩ {𝑥 ∣ 𝜑} = ∩ {𝑦 ∣ 𝜓}
1511, 14sseqtrri 3980 . 2 ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ ∩ {𝑥 ∣ 𝜑}
16 simpr 490 . . . 4 ((𝑥 ⊆ 𝐴 ∧ 𝜑) → 𝜑)
1716ss2abi 4014 . . 3 {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ {𝑥 ∣ 𝜑}
18 intss 4929 . . 3 ({𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} ⊆ {𝑥 ∣ 𝜑} → ∩ {𝑥 ∣ 𝜑} ⊆ ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)})
1917, 18ax-mp 5 . 2 ∩ {𝑥 ∣ 𝜑} ⊆ ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)}
2015, 19eqssi 3947 1 ∩ {𝑥 ∣ (𝑥 ⊆ 𝐴 ∧ 𝜑)} = ∩ {𝑥 ∣ 𝜑}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  Vcvv 3451   ⊆ wss 3899  ∩ cint 4907
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-ext 2733  ax-sep 5249
This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-in 3906  df-ss 3916  df-nul 4280  df-int 4908
This theorem is used by:  dfnn3  12330
  Copyright terms: Public domain W3C validator