Theorem djuss 10038

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 10037	. . 3 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)))
2		simpr 490	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = (inl‘𝑦))
3		df-inl 10020	. . . . . . . . 9 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
4		opeq2 4846	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨∅, 𝑥⟩ = ⟨∅, 𝑦⟩)
5		elex 3475	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ V)
6		opex 5439	. . . . . . . . . 10 ⊢ ⟨∅, 𝑦⟩ ∈ V
7	6	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → ⟨∅, 𝑦⟩ ∈ V)
8	3, 4, 5, 7	fvmptd3 7048	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (inl‘𝑦) = ⟨∅, 𝑦⟩)
9	8	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (inl‘𝑦) = ⟨∅, 𝑦⟩)
10	2, 9	eqtrd 2798	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = ⟨∅, 𝑦⟩)
11		elun1 4183	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ (𝐴 ∪ 𝐵))
12		0ex 5267	. . . . . . . . . 10 ⊢ ∅ ∈ V
13	12	prid1 4725	. . . . . . . . 9 ⊢ ∅ ∈ {∅, 1o}
14	11, 13	jctil 529	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
15	14	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
16		opelxp 5694	. . . . . . 7 ⊢ (⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
17	15, 16	sylibr 237	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → ⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
18	10, 17	eqeltrd 2864	. . . . 5 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
19	18	rexlimiva 3159	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
20		simpr 490	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = (inr‘𝑦))
21		df-inr 10021	. . . . . . . . 9 ⊢ inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
22		opeq2 4846	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨1o, 𝑥⟩ = ⟨1o, 𝑦⟩)
23		elex 3475	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ V)
24		opex 5439	. . . . . . . . . 10 ⊢ ⟨1o, 𝑦⟩ ∈ V
25	24	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → ⟨1o, 𝑦⟩ ∈ V)
26	21, 22, 23, 25	fvmptd3 7048	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (inr‘𝑦) = ⟨1o, 𝑦⟩)
27	26	adantr 486	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (inr‘𝑦) = ⟨1o, 𝑦⟩)
28	20, 27	eqtrd 2798	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = ⟨1o, 𝑦⟩)
29		elun2 4184	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ (𝐴 ∪ 𝐵))
30	29	adantr 486	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑦 ∈ (𝐴 ∪ 𝐵))
31		1oelpr 8525	. . . . . . . 8 ⊢ 1o ∈ {∅, 1o}
32	30, 31	jctil 529	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
33		opelxp 5694	. . . . . . 7 ⊢ (⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
34	32, 33	sylibr 237	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → ⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
35	28, 34	eqeltrd 2864	. . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
36	35	rexlimiva 3159	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
37	19, 36	jaoi 871	. . 3 ⊢ ((∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
38	1, 37	syl 18	. 2 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
39	38	ssriv 3917	1 ⊢ (𝐴 ⊔ 𝐵) ⊆ ({∅, 1o} × (𝐴 ∪ 𝐵))

This proof depends on syntax axioms:   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∪ cun 4152  ∅c0 4281  {cpr 4590  ⟨cop 4840   × cxp 5656  ‘cfv 6566  1_oc1o 8507   ⊔ cdju 10016  inlcinl 10017  inrcinr 10018

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-suc 6394  df-iota 6520  df-fun 6568  df-fv 6574  df-1st 8035  df-2nd 8036  df-1o 8514  df-dju 10019  df-inl 10020  df-inr 10021

This theorem is used by:  djuunxp  10039  djuexALT  10040  eldju1st  10041