Theorem ssrel2 5769

Description: A subclass relationship depends only on a relation's ordered pairs. This version of ssrel 5767 is restricted to the relation's domain. (Contributed by Thierry Arnoux, 25-Jan-2018.)

Assertion

Ref	Expression
ssrel2	⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑅 ⊆ 𝑆 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

Proof of Theorem ssrel2

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3928	. . . 4 ⊢ (𝑅 ⊆ 𝑆 → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆))
2	1	a1d 26	. . 3 ⊢ (𝑅 ⊆ 𝑆 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
3	2	ralrimivv 3205	. 2 ⊢ (𝑅 ⊆ 𝑆 → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆))
4		eleq1 2850	. . . . . . . . . . 11 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
5		eleq1 2850	. . . . . . . . . . 11 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑆 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑆))
6	4, 5	imbi12d 347	. . . . . . . . . 10 ⊢ (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
7	6	biimprcd 253	. . . . . . . . 9 ⊢ ((⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
8	7	2ralimi 3134	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
9		r19.23v 3191	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)) ↔ (∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
10	9	ralbii 3110	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)) ↔ ∀𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
11		r19.23v 3191	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
12	10, 11	bitri 278	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
13	8, 12	sylib 221	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
14	13	com23 87	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑧 ∈ 𝑅 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → 𝑧 ∈ 𝑆)))
15	14	a2d 30	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → ((𝑧 ∈ 𝑅 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
16	15	alimdv 1949	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (∀𝑧(𝑧 ∈ 𝑅 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩) → ∀𝑧(𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆)))
17		df-ss 3919	. . . . 5 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) ↔ ∀𝑧(𝑧 ∈ 𝑅 → 𝑧 ∈ (𝐴 × 𝐵)))
18		elxp2 5683	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩)
19	18	imbi2i 339	. . . . . 6 ⊢ ((𝑧 ∈ 𝑅 → 𝑧 ∈ (𝐴 × 𝐵)) ↔ (𝑧 ∈ 𝑅 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
20	19	albii 1852	. . . . 5 ⊢ (∀𝑧(𝑧 ∈ 𝑅 → 𝑧 ∈ (𝐴 × 𝐵)) ↔ ∀𝑧(𝑧 ∈ 𝑅 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
21	17, 20	bitri 278	. . . 4 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) ↔ ∀𝑧(𝑧 ∈ 𝑅 → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
22		df-ss 3919	. . . 4 ⊢ (𝑅 ⊆ 𝑆 ↔ ∀𝑧(𝑧 ∈ 𝑅 → 𝑧 ∈ 𝑆))
23	16, 21, 22	3imtr4g 299	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑅 ⊆ (𝐴 × 𝐵) → 𝑅 ⊆ 𝑆))
24	23	com12 33	. 2 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → 𝑅 ⊆ 𝑆))
25	3, 24	impbid2 229	1 ⊢ (𝑅 ⊆ (𝐴 × 𝐵) → (𝑅 ⊆ 𝑆 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570   ∈ wcel 2145  ∀wral 3078  ∃wrex 3088   ⊆ wss 3902  ⟨cop 4593   × cxp 5657

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-un 3907  df-in 3909  df-ss 3919  df-sn 4588  df-pr 4590  df-op 4594  df-opab 5172  df-xp 5665

This theorem is used by:  metuel2  24797  isarchi  33630