Theorem djuss 10008

Description: A disjoint union is a subclass of a Cartesian product. (Contributed by AV, 25-Jun-2022.)

Assertion

Ref	Expression
djuss	⊢ (𝐴 ⊔ 𝐵) ⊆ ({∅, 1o} × (𝐴 ∪ 𝐵))

Proof of Theorem djuss

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

Step	Hyp	Ref	Expression
1		djur 10007	. . 3 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)))
2		simpr 490	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = (inl‘𝑦))
3		df-inl 9990	. . . . . . . . 9 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
4		opeq2 4840	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨∅, 𝑥⟩ = ⟨∅, 𝑦⟩)
5		elex 3471	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ V)
6		opex 5432	. . . . . . . . . 10 ⊢ ⟨∅, 𝑦⟩ ∈ V
7	6	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → ⟨∅, 𝑦⟩ ∈ V)
8	3, 4, 5, 7	fvmptd3 7022	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (inl‘𝑦) = ⟨∅, 𝑦⟩)
9	8	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (inl‘𝑦) = ⟨∅, 𝑦⟩)
10	2, 9	eqtrd 2795	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = ⟨∅, 𝑦⟩)
11		elun1 4179	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ (𝐴 ∪ 𝐵))
12		0ex 5260	. . . . . . . . . 10 ⊢ ∅ ∈ V
13	12	prid1 4719	. . . . . . . . 9 ⊢ ∅ ∈ {∅, 1o}
14	11, 13	jctil 529	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
15	14	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
16		opelxp 5687	. . . . . . 7 ⊢ (⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
17	15, 16	sylibr 237	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → ⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
18	10, 17	eqeltrd 2860	. . . . 5 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
19	18	rexlimiva 3155	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
20		simpr 490	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = (inr‘𝑦))
21		df-inr 9991	. . . . . . . . 9 ⊢ inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
22		opeq2 4840	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨1o, 𝑥⟩ = ⟨1o, 𝑦⟩)
23		elex 3471	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ V)
24		opex 5432	. . . . . . . . . 10 ⊢ ⟨1o, 𝑦⟩ ∈ V
25	24	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → ⟨1o, 𝑦⟩ ∈ V)
26	21, 22, 23, 25	fvmptd3 7022	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (inr‘𝑦) = ⟨1o, 𝑦⟩)
27	26	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (inr‘𝑦) = ⟨1o, 𝑦⟩)
28	20, 27	eqtrd 2795	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = ⟨1o, 𝑦⟩)
29		elun2 4180	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ (𝐴 ∪ 𝐵))
30	29	adantr 486	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑦 ∈ (𝐴 ∪ 𝐵))
31		1oelpr 8494	. . . . . . . 8 ⊢ 1o ∈ {∅, 1o}
32	30, 31	jctil 529	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
33		opelxp 5687	. . . . . . 7 ⊢ (⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
34	32, 33	sylibr 237	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → ⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
35	28, 34	eqeltrd 2860	. . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
36	35	rexlimiva 3155	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
37	19, 36	jaoi 871	. . 3 ⊢ ((∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
38	1, 37	syl 18	. 2 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
39	38	ssriv 3913	1 ⊢ (𝐴 ⊔ 𝐵) ⊆ ({∅, 1o} × (𝐴 ∪ 𝐵))

This proof depends on syntax axioms:   ∧ wa 401   ∨ wo 861   = wceq 1569   ∈ wcel 2144  ∃wrex 3086  Vcvv 3450   ⊆ wss 3896   ∪ cun 4148  ∅c0 4277  {cpr 4586  ⟨cop 4834   × cxp 5649  ‘cfv 6543  1_oc1o 8476   ⊔ cdju 9986  inlcinl 9987  inrcinr 9988

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-suc 6371  df-iota 6497  df-fun 6545  df-fv 6551  df-1st 8005  df-2nd 8006  df-1o 8483  df-dju 9989  df-inl 9990  df-inr 9991

This theorem is used by:  djuunxp  10009  djuexALT  10010  eldju1st  10011