Theorem sscoid 36492

Description: A condition for subset and composition with identity. (Contributed by Scott Fenton, 13-Apr-2018.)

Assertion

Ref	Expression
sscoid	⊢ (𝐴 ⊆ ( I ∘ 𝐵) ↔ (Rel 𝐴 ∧ 𝐴 ⊆ 𝐵))

Proof of Theorem sscoid

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

Step	Hyp	Ref	Expression
1		relco 6108	. . 3 ⊢ Rel ( I ∘ 𝐵)
2		relss 5766	. . 3 ⊢ (𝐴 ⊆ ( I ∘ 𝐵) → (Rel ( I ∘ 𝐵) → Rel 𝐴))
3	1, 2	mpi 21	. 2 ⊢ (𝐴 ⊆ ( I ∘ 𝐵) → Rel 𝐴)
4		elrel 5782	. . . . . 6 ⊢ ((Rel 𝐴 ∧ 𝑥 ∈ 𝐴) → ∃𝑦∃𝑧 𝑥 = ⟨𝑦, 𝑧⟩)
5		vex 3457	. . . . . . . . . . 11 ⊢ 𝑦 ∈ V
6		vex 3457	. . . . . . . . . . 11 ⊢ 𝑧 ∈ V
7	5, 6	brco 5854	. . . . . . . . . 10 ⊢ (𝑦( I ∘ 𝐵)𝑧 ↔ ∃𝑥(𝑦𝐵𝑥 ∧ 𝑥 I 𝑧))
8	6	ideq 5836	. . . . . . . . . . . 12 ⊢ (𝑥 I 𝑧 ↔ 𝑥 = 𝑧)
9	8	anbi1ci 638	. . . . . . . . . . 11 ⊢ ((𝑦𝐵𝑥 ∧ 𝑥 I 𝑧) ↔ (𝑥 = 𝑧 ∧ 𝑦𝐵𝑥))
10	9	exbii 1881	. . . . . . . . . 10 ⊢ (∃𝑥(𝑦𝐵𝑥 ∧ 𝑥 I 𝑧) ↔ ∃𝑥(𝑥 = 𝑧 ∧ 𝑦𝐵𝑥))
11		breq2 5111	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 → (𝑦𝐵𝑥 ↔ 𝑦𝐵𝑧))
12	11	equsexvw 2038	. . . . . . . . . 10 ⊢ (∃𝑥(𝑥 = 𝑧 ∧ 𝑦𝐵𝑥) ↔ 𝑦𝐵𝑧)
13	7, 10, 12	3bitri 300	. . . . . . . . 9 ⊢ (𝑦( I ∘ 𝐵)𝑧 ↔ 𝑦𝐵𝑧)
14	13	a1i 11	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑦( I ∘ 𝐵)𝑧 ↔ 𝑦𝐵𝑧))
15		eleq1 2850	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ ( I ∘ 𝐵) ↔ ⟨𝑦, 𝑧⟩ ∈ ( I ∘ 𝐵)))
16		df-br 5108	. . . . . . . . 9 ⊢ (𝑦( I ∘ 𝐵)𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ ( I ∘ 𝐵))
17	15, 16	bitr4di 292	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ ( I ∘ 𝐵) ↔ 𝑦( I ∘ 𝐵)𝑧))
18		eleq1 2850	. . . . . . . . 9 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ 𝐵 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐵))
19		df-br 5108	. . . . . . . . 9 ⊢ (𝑦𝐵𝑧 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐵)
20	18, 19	bitr4di 292	. . . . . . . 8 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ 𝐵 ↔ 𝑦𝐵𝑧))
21	14, 17, 20	3bitr4d 314	. . . . . . 7 ⊢ (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ ( I ∘ 𝐵) ↔ 𝑥 ∈ 𝐵))
22	21	exlimivv 1965	. . . . . 6 ⊢ (∃𝑦∃𝑧 𝑥 = ⟨𝑦, 𝑧⟩ → (𝑥 ∈ ( I ∘ 𝐵) ↔ 𝑥 ∈ 𝐵))
23	4, 22	syl 18	. . . . 5 ⊢ ((Rel 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑥 ∈ ( I ∘ 𝐵) ↔ 𝑥 ∈ 𝐵))
24	23	pm5.74da 816	. . . 4 ⊢ (Rel 𝐴 → ((𝑥 ∈ 𝐴 → 𝑥 ∈ ( I ∘ 𝐵)) ↔ (𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)))
25	24	albidv 1953	. . 3 ⊢ (Rel 𝐴 → (∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ( I ∘ 𝐵)) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵)))
26		df-ss 3919	. . 3 ⊢ (𝐴 ⊆ ( I ∘ 𝐵) ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ ( I ∘ 𝐵)))
27		df-ss 3919	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝑥 ∈ 𝐵))
28	25, 26, 27	3bitr4g 317	. 2 ⊢ (Rel 𝐴 → (𝐴 ⊆ ( I ∘ 𝐵) ↔ 𝐴 ⊆ 𝐵))
29	3, 28	biadanii 834	1 ⊢ (𝐴 ⊆ ( I ∘ 𝐵) ↔ (Rel 𝐴 ∧ 𝐴 ⊆ 𝐵))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ⊆ wss 3902  ⟨cop 4593   class class class wbr 5107   I cid 5553   ∘ ccom 5663  Rel wrel 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 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-fal 1583  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-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-co 5668

This theorem is used by:  dffun10  36493