Theorem dminss 5466

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 2039	. . . . . . 7 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
2	1	ancoms 468	. . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
3		vex 3176	. . . . . . 7 ⊢ 𝑦 ∈ V
4	3	elima2 5391	. . . . . 6 ⊢ (𝑦 ∈ (𝑅 “ 𝐴) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦))
5	2, 4	sylibr 223	. . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦 ∈ (𝑅 “ 𝐴))
6		simpl 472	. . . . . 6 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑥𝑅𝑦)
7		vex 3176	. . . . . . 7 ⊢ 𝑥 ∈ V
8	3, 7	brcnv 5227	. . . . . 6 ⊢ (𝑦◡𝑅𝑥 ↔ 𝑥𝑅𝑦)
9	6, 8	sylibr 223	. . . . 5 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → 𝑦◡𝑅𝑥)
10	5, 9	jca 553	. . . 4 ⊢ ((𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → (𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
11	10	eximi 1752	. . 3 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) → ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
12	7	eldm 5243	. . . . 5 ⊢ (𝑥 ∈ dom 𝑅 ↔ ∃𝑦 𝑥𝑅𝑦)
13	12	anbi1i 727	. . . 4 ⊢ ((𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
14		elin 3758	. . . 4 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ (𝑥 ∈ dom 𝑅 ∧ 𝑥 ∈ 𝐴))
15		19.41v 1901	. . . 4 ⊢ (∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴) ↔ (∃𝑦 𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
16	13, 14, 15	3bitr4i 291	. . 3 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) ↔ ∃𝑦(𝑥𝑅𝑦 ∧ 𝑥 ∈ 𝐴))
17	7	elima2 5391	. . 3 ⊢ (𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)) ↔ ∃𝑦(𝑦 ∈ (𝑅 “ 𝐴) ∧ 𝑦◡𝑅𝑥))
18	11, 16, 17	3imtr4i 280	. 2 ⊢ (𝑥 ∈ (dom 𝑅 ∩ 𝐴) → 𝑥 ∈ (◡𝑅 “ (𝑅 “ 𝐴)))
19	18	ssriv 3572	1 ⊢ (dom 𝑅 ∩ 𝐴) ⊆ (◡𝑅 “ (𝑅 “ 𝐴))

Syntax hints:   ∧ wa 383  ∃wex 1695   ∈ wcel 1977   ∩ cin 3539   ⊆ wss 3540   class class class wbr 4583  ^◡ccnv 5037  dom cdm 5038   “ cima 5041

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051

This theorem is referenced by:  lmhmlsp  18870  cnclsi  20886  kgencn3  21171  kqsat  21344  kqcldsat  21346  cfilucfil  22174