Theorem dminss 6119

Description: An upper bound for intersection with a domain. Theorem 40 of [Suppes] p. 66, who calls it "somewhat surprising". (Contributed by NM, 11-Aug-2004.)

Assertion

Ref	Expression
dminss	⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴))

Proof of Theorem dminss

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		19.8a 2189	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
2	1	ancoms 458	. . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
3		vex 3446	. . . . . . 7 ⊢ 𝑦 ∈ V
4	3	elima2 6033	. . . . . 6 ⊢ (𝑦 ∈ (𝑅 “ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
5	2, 4	sylibr 234	. . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ (𝑅 “ 𝐴))
6		simpl 482	. . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑥𝑅𝑦)
7		vex 3446	. . . . . . 7 ⊢ 𝑥 ∈ V
8	3, 7	brcnv 5839	. . . . . 6 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)
9	6, 8	sylibr 234	. . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦◡𝑅𝑥)
10	5, 9	jca 511	. . . 4 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
11	10	eximi 1837	. . 3 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
12	7	eldm 5857	. . . . 5 ⊢ (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦)
13	12	anbi1i 625	. . . 4 ⊢ ((𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
14		elin 3919	. . . 4 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ (𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴))
15		19.41v 1951	. . . 4 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
16	13, 14, 15	3bitr4i 303	. . 3 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
17	7	elima2 6033	. . 3 ⊢ (𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
18	11, 16, 17	3imtr4i 292	. 2 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)))
19	18	ssriv 3939	1 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴))

Syntax hints:   ∧ wa 395  ∃wex 1781   ∈ wcel 2114   ∩ cin 3902   ⊆ wss 3903   class class class wbr 5100  ^◡ccnv 5631  dom cdm 5632   “ cima 5635

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-xp 5638  df-cnv 5640  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645

This theorem is referenced by:  lmhmlsp  21013  cnclsi  23228  kgencn3  23514  kqsat  23687  kqcldsat  23689  cfilucfil  24515  elrgspnsubrunlem2  33341  elrspunidl  33520