Theorem ssrelrel 5787

Description: A subclass relationship determined by ordered triples. Use relrelss 6280 to express the antecedent in terms of the relation predicate. (Contributed by NM, 17-Dec-2008.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

Ref	Expression
ssrelrel	⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧

Proof of Theorem ssrelrel

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssel 3934	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
2	1	alrimiv 1960	. . 3 ⊢ (𝐴 ⊆ 𝐵 → ∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
3	2	alrimivv 1961	. 2 ⊢ (𝐴 ⊆ 𝐵 → ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
4		elvvv 5742	. . . . . . . 8 ⊢ (𝑤 ∈ ((V × V) × V) ↔ ∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩)
5		eleq1 2854	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴))
6		eleq1 2854	. . . . . . . . . . . . . 14 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐵 ↔ ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵))
7	5, 6	imbi12d 347	. . . . . . . . . . . . 13 ⊢ (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → ((𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵) ↔ (⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))
8	7	biimprcd 253	. . . . . . . . . . . 12 ⊢ ((⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
9	8	alimi 1844	. . . . . . . . . . 11 ⊢ (∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ∀𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
10		19.23v 1975	. . . . . . . . . . 11 ⊢ (∀𝑧(𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)) ↔ (∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
11	9, 10	sylib 221	. . . . . . . . . 10 ⊢ (∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
12	11	2alimi 1845	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ∀𝑥∀𝑦(∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
13		19.23vv 1976	. . . . . . . . 9 ⊢ (∀𝑥∀𝑦(∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)) ↔ (∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
14	12, 13	sylib 221	. . . . . . . 8 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∃𝑥∃𝑦∃𝑧 𝑤 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
15	4, 14	biimtrid 245	. . . . . . 7 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 ∈ ((V × V) × V) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
16	15	com23 87	. . . . . 6 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝑤 ∈ 𝐴 → (𝑤 ∈ ((V × V) × V) → 𝑤 ∈ 𝐵)))
17	16	a2d 30	. . . . 5 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → ((𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)) → (𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
18	17	alimdv 1949	. . . 4 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)) → ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵)))
19		df-ss 3925	. . . 4 ⊢ (𝐴 ⊆ ((V × V) × V) ↔ ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ ((V × V) × V)))
20		df-ss 3925	. . . 4 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑤(𝑤 ∈ 𝐴 → 𝑤 ∈ 𝐵))
21	18, 19, 20	3imtr4g 299	. . 3 ⊢ (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → (𝐴 ⊆ ((V × V) × V) → 𝐴 ⊆ 𝐵))
22	21	com12 33	. 2 ⊢ (𝐴 ⊆ ((V × V) × V) → (∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵) → 𝐴 ⊆ 𝐵))
23	3, 22	impbid2 229	1 ⊢ (𝐴 ⊆ ((V × V) × V) → (𝐴 ⊆ 𝐵 ↔ ∀𝑥∀𝑦∀𝑧(⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐴 → ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∈ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2146  Vcvv 3458   ⊆ wss 3908  ⟨cop 4600   × cxp 5664

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 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5179  df-xp 5672

This theorem is used by:  eqrelrel  5788