HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem difrab 1695
Description: Difference of two restricted class abstractions.
Assertion
Ref Expression
difrab ({xAφ} ∖ {xAψ}) = {xA∣(φ ∧ ¬ ψ)}

Proof of Theorem difrab
StepHypRef Expression
1 difab 1693 . . 3 ({x∣(xAφ)} ∖ {x∣(xAψ)}) = {x∣((xAφ) ∧ ¬ (xAψ))}
2 anass 336 . . . . 5 (((xAφ) ∧ ¬ ψ) ↔ (xA ∧ (φ ∧ ¬ ψ)))
3 pm3.27 260 . . . . . . . 8 ((xAψ) → ψ)
43con3i 90 . . . . . . 7 ψ → ¬ (xAψ))
54anim2i 270 . . . . . 6 (((xAφ) ∧ ¬ ψ) → ((xAφ) ∧ ¬ (xAψ)))
6 pm3.2 232 . . . . . . . . 9 (xA → (ψ → (xAψ)))
76adantr 306 . . . . . . . 8 ((xAφ) → (ψ → (xAψ)))
87con3d 87 . . . . . . 7 ((xAφ) → (¬ (xAψ) → ¬ ψ))
98imdistani 340 . . . . . 6 (((xAφ) ∧ ¬ (xAψ)) → ((xAφ) ∧ ¬ ψ))
105, 9impbi 139 . . . . 5 (((xAφ) ∧ ¬ ψ) ↔ ((xAφ) ∧ ¬ (xAψ)))
112, 10bitr3 153 . . . 4 ((xA ∧ (φ ∧ ¬ ψ)) ↔ ((xAφ) ∧ ¬ (xAψ)))
1211biabi 1181 . . 3 {x∣(xA ∧ (φ ∧ ¬ ψ))} = {x∣((xAφ) ∧ ¬ (xAψ))}
131, 12eqtr4 1122 . 2 ({x∣(xAφ)} ∖ {x∣(xAψ)}) = {x∣(xA ∧ (φ ∧ ¬ ψ))}
14 df-rab 1208 . . 3 {xAφ} = {x∣(xAφ)}
15 df-rab 1208 . . 3 {xAψ} = {x∣(xAψ)}
1614, 15difeq12i 1586 . 2 ({xAφ} ∖ {xAψ}) = ({x∣(xAφ)} ∖ {x∣(xAψ)})
17 df-rab 1208 . 2 {xA∣(φ ∧ ¬ ψ)} = {x∣(xA ∧ (φ ∧ ¬ ψ))}
1813, 16, 173eqtr4 1126 1 ({xAφ} ∖ {xAψ}) = {xA∣(φ ∧ ¬ ψ)}
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ∧ wa 196  {cab 1090   = wceq 1091   ∈ wcel 1092  {crab 1204   ∖ cdif 1484
This theorem is referenced by:  alephsuc3 4955
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-rab 1208  df-v 1349  df-dif 1489  df-in 1491
metamath.org