Theorem djuss 9989

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 9988	. . 3 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)))
2		simpr 484	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = (inl‘𝑦))
3		df-inl 9971	. . . . . . . . 9 ⊢ inl = (𝑥 ∈ V ↦ ⟨∅, 𝑥⟩)
4		opeq2 4898	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨∅, 𝑥⟩ = ⟨∅, 𝑦⟩)
5		elex 3509	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ V)
6		opex 5484	. . . . . . . . . 10 ⊢ ⟨∅, 𝑦⟩ ∈ V
7	6	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → ⟨∅, 𝑦⟩ ∈ V)
8	3, 4, 5, 7	fvmptd3 7052	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (inl‘𝑦) = ⟨∅, 𝑦⟩)
9	8	adantr 480	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (inl‘𝑦) = ⟨∅, 𝑦⟩)
10	2, 9	eqtrd 2780	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 = ⟨∅, 𝑦⟩)
11		elun1 4205	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐴 → 𝑦 ∈ (𝐴 ∪ 𝐵))
12		0ex 5325	. . . . . . . . . 10 ⊢ ∅ ∈ V
13	12	prid1 4787	. . . . . . . . 9 ⊢ ∅ ∈ {∅, 1o}
14	11, 13	jctil 519	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐴 → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
15	14	adantr 480	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
16		opelxp 5736	. . . . . . 7 ⊢ (⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (∅ ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
17	15, 16	sylibr 234	. . . . . 6 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → ⟨∅, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
18	10, 17	eqeltrd 2844	. . . . 5 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝑥 = (inl‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
19	18	rexlimiva 3153	. . . 4 ⊢ (∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
20		simpr 484	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = (inr‘𝑦))
21		df-inr 9972	. . . . . . . . 9 ⊢ inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
22		opeq2 4898	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨1o, 𝑥⟩ = ⟨1o, 𝑦⟩)
23		elex 3509	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ V)
24		opex 5484	. . . . . . . . . 10 ⊢ ⟨1o, 𝑦⟩ ∈ V
25	24	a1i 11	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → ⟨1o, 𝑦⟩ ∈ V)
26	21, 22, 23, 25	fvmptd3 7052	. . . . . . . 8 ⊢ (𝑦 ∈ 𝐵 → (inr‘𝑦) = ⟨1o, 𝑦⟩)
27	26	adantr 480	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (inr‘𝑦) = ⟨1o, 𝑦⟩)
28	20, 27	eqtrd 2780	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 = ⟨1o, 𝑦⟩)
29		elun2 4206	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝐵 → 𝑦 ∈ (𝐴 ∪ 𝐵))
30	29	adantr 480	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑦 ∈ (𝐴 ∪ 𝐵))
31		1oex 8532	. . . . . . . . 9 ⊢ 1o ∈ V
32	31	prid2 4788	. . . . . . . 8 ⊢ 1o ∈ {∅, 1o}
33	30, 32	jctil 519	. . . . . . 7 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
34		opelxp 5736	. . . . . . 7 ⊢ (⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)) ↔ (1o ∈ {∅, 1o} ∧ 𝑦 ∈ (𝐴 ∪ 𝐵)))
35	33, 34	sylibr 234	. . . . . 6 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → ⟨1o, 𝑦⟩ ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
36	28, 35	eqeltrd 2844	. . . . 5 ⊢ ((𝑦 ∈ 𝐵 ∧ 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
37	36	rexlimiva 3153	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
38	19, 37	jaoi 856	. . 3 ⊢ ((∃𝑦 ∈ 𝐴 𝑥 = (inl‘𝑦) ∨ ∃𝑦 ∈ 𝐵 𝑥 = (inr‘𝑦)) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
39	1, 38	syl 17	. 2 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) → 𝑥 ∈ ({∅, 1o} × (𝐴 ∪ 𝐵)))
40	39	ssriv 4012	1 ⊢ (𝐴 ⊔ 𝐵) ⊆ ({∅, 1o} × (𝐴 ∪ 𝐵))

Syntax hints:   ∧ wa 395   ∨ wo 846   = wceq 1537   ∈ wcel 2108  ∃wrex 3076  Vcvv 3488   ∪ cun 3974   ⊆ wss 3976  ∅c0 4352  {cpr 4650  ⟨cop 4654   × cxp 5698  ‘cfv 6573  1_oc1o 8515   ⊔ cdju 9967  inlcinl 9968  inrcinr 9969

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-suc 6401  df-iota 6525  df-fun 6575  df-fv 6581  df-1st 8030  df-2nd 8031  df-1o 8522  df-dju 9970  df-inl 9971  df-inr 9972

This theorem is referenced by:  djuunxp  9990  djuexALT  9991  eldju1st  9992