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

Theorem intmin4 3898
Description: Elimination of a conjunct in a class intersection. (Contributed by NM, 31-Jul-2006.)
Assertion
Ref Expression
intmin4 (𝐴 {𝑥𝜑} → {𝑥 ∣ (𝐴𝑥𝜑)} = {𝑥𝜑})
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem intmin4
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ssintab 3887 . . . 4 (𝐴 {𝑥𝜑} ↔ ∀𝑥(𝜑𝐴𝑥))
2 simpr 110 . . . . . . . 8 ((𝐴𝑥𝜑) → 𝜑)
3 ancr 321 . . . . . . . 8 ((𝜑𝐴𝑥) → (𝜑 → (𝐴𝑥𝜑)))
42, 3impbid2 143 . . . . . . 7 ((𝜑𝐴𝑥) → ((𝐴𝑥𝜑) ↔ 𝜑))
54imbi1d 231 . . . . . 6 ((𝜑𝐴𝑥) → (((𝐴𝑥𝜑) → 𝑦𝑥) ↔ (𝜑𝑦𝑥)))
65alimi 1466 . . . . 5 (∀𝑥(𝜑𝐴𝑥) → ∀𝑥(((𝐴𝑥𝜑) → 𝑦𝑥) ↔ (𝜑𝑦𝑥)))
7 albi 1479 . . . . 5 (∀𝑥(((𝐴𝑥𝜑) → 𝑦𝑥) ↔ (𝜑𝑦𝑥)) → (∀𝑥((𝐴𝑥𝜑) → 𝑦𝑥) ↔ ∀𝑥(𝜑𝑦𝑥)))
86, 7syl 14 . . . 4 (∀𝑥(𝜑𝐴𝑥) → (∀𝑥((𝐴𝑥𝜑) → 𝑦𝑥) ↔ ∀𝑥(𝜑𝑦𝑥)))
91, 8sylbi 121 . . 3 (𝐴 {𝑥𝜑} → (∀𝑥((𝐴𝑥𝜑) → 𝑦𝑥) ↔ ∀𝑥(𝜑𝑦𝑥)))
10 vex 2763 . . . 4 𝑦 ∈ V
1110elintab 3881 . . 3 (𝑦 {𝑥 ∣ (𝐴𝑥𝜑)} ↔ ∀𝑥((𝐴𝑥𝜑) → 𝑦𝑥))
1210elintab 3881 . . 3 (𝑦 {𝑥𝜑} ↔ ∀𝑥(𝜑𝑦𝑥))
139, 11, 123bitr4g 223 . 2 (𝐴 {𝑥𝜑} → (𝑦 {𝑥 ∣ (𝐴𝑥𝜑)} ↔ 𝑦 {𝑥𝜑}))
1413eqrdv 2191 1 (𝐴 {𝑥𝜑} → {𝑥 ∣ (𝐴𝑥𝜑)} = {𝑥𝜑})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1362   = wceq 1364  wcel 2164  {cab 2179  wss 3153   cint 3870
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-v 2762  df-in 3159  df-ss 3166  df-int 3871
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator