Theorem intmin 3676

Description: Any member of a class is the smallest of those members that include it. (Contributed by NM, 13-Aug-2002.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)

Assertion

Ref	Expression
intmin	⊢ (𝐴 ∈ 𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} = 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem intmin

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2613	. . . . 5 ⊢ 𝑦 ∈ V
2	1	elintrab 3668	. . . 4 ⊢ (𝑦 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ↔ ∀𝑥 ∈ 𝐵 (𝐴 ⊆ 𝑥 → 𝑦 ∈ 𝑥))
3		ssid 3027	. . . . 5 ⊢ 𝐴 ⊆ 𝐴
4		sseq2 3030	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝐴 ⊆ 𝑥 ↔ 𝐴 ⊆ 𝐴))
5		eleq2 2146	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝑥 ↔ 𝑦 ∈ 𝐴))
6	4, 5	imbi12d 232	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝐴 ⊆ 𝑥 → 𝑦 ∈ 𝑥) ↔ (𝐴 ⊆ 𝐴 → 𝑦 ∈ 𝐴)))
7	6	rspcv 2706	. . . . 5 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐴 ⊆ 𝑥 → 𝑦 ∈ 𝑥) → (𝐴 ⊆ 𝐴 → 𝑦 ∈ 𝐴)))
8	3, 7	mpii 43	. . . 4 ⊢ (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐴 ⊆ 𝑥 → 𝑦 ∈ 𝑥) → 𝑦 ∈ 𝐴))
9	2, 8	syl5bi 150	. . 3 ⊢ (𝐴 ∈ 𝐵 → (𝑦 ∈ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} → 𝑦 ∈ 𝐴))
10	9	ssrdv 3014	. 2 ⊢ (𝐴 ∈ 𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ⊆ 𝐴)
11		ssintub 3674	. . 3 ⊢ 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥}
12	11	a1i 9	. 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥})
13	10, 12	eqssd 3025	1 ⊢ (𝐴 ∈ 𝐵 → ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} = 𝐴)

Syntax hints:   → wi 4   = wceq 1285   ∈ wcel 1434  ∀wral 2353  {crab 2357   ⊆ wss 2982  ∩ cint 3656

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 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065

This theorem depends on definitions:  df-bi 115  df-tru 1288  df-nf 1391  df-sb 1688  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rab 2362  df-v 2612  df-in 2988  df-ss 2995  df-int 3657

This theorem is referenced by:  intmin2  3682  bm2.5ii  4268  onsucmin  4279