Theorem updjud 9878

Description: Universal property of the disjoint union. This theorem shows that the disjoint union, together with the left and right injections df-inl 9846 and df-inr 9847, is the coproduct in the category of sets, see Wikipedia "Coproduct", https://en.wikipedia.org/wiki/Coproduct 9847 (25-Aug-2023). This is a special case of Example 1 of coproducts in Section 10.67 of [Adamek] p. 185. (Proposed by BJ, 25-Jun-2022.) (Contributed by AV, 28-Jun-2022.)

Hypotheses

Ref	Expression
updjud.f	⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
updjud.g	⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
updjud.a	⊢ (𝜑 → 𝐴 ∈ 𝑉)
updjud.b	⊢ (𝜑 → 𝐵 ∈ 𝑊)

Assertion

Ref	Expression
updjud	⊢ (𝜑 → ∃!ℎ(ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))

Distinct variable groups:   𝐴,ℎ   𝐵,ℎ   𝐶,ℎ   ℎ,𝐹   ℎ,𝐺   𝜑,ℎ

Allowed substitution hints:   𝑉(ℎ)   𝑊(ℎ)

Proof of Theorem updjud

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

Step	Hyp	Ref	Expression
1		updjud.a	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
2		updjud.b	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
3	1, 2	jca 518	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊))
4		djuex 9852	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ⊔ 𝐵) ∈ V)
5		mptexg 7190	. . . . 5 ⊢ ((𝐴 ⊔ 𝐵) ∈ V → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∈ V)
6	3, 4, 5	3syl 18	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∈ V)
7		feq1 6654	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ↔ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶))
8		coeq1 5818	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (ℎ ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)))
9	8	eqeq1d 2754	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → ((ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹))
10		coeq1 5818	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (ℎ ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)))
11	10	eqeq1d 2754	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → ((ℎ ∘ (inr ↾ 𝐵)) = 𝐺 ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺))
12	7, 9, 11	3anbi123d 1447	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)))
13		eqeq1 2756	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (ℎ = 𝑘 ↔ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))
14	13	imbi2d 342	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘) ↔ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘)))
15	14	ralbidv 3175	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘) ↔ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘)))
16	12, 15	anbi12d 640	. . . . 5 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) → (((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)) ↔ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))))
17	16	adantl 484	. . . 4 ⊢ ((𝜑 ∧ ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))) → (((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)) ↔ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))))
18		updjud.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
19		updjud.g	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
20		eqid 2752	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))
21	18, 19, 20	updjudhf 9875	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶)
22	18, 19, 20	updjudhcoinlf 9876	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹)
23	18, 19, 20	updjudhcoinrg 9877	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)
24		simpr 487	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺))
25		eqeq2 2764	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑘 ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) ↔ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹))
26		fvres 6871	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑧 ∈ 𝐴 → ((inl ↾ 𝐴)‘𝑧) = (inl‘𝑧))
27	26	eqcomd 2758	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑧 ∈ 𝐴 → (inl‘𝑧) = ((inl ↾ 𝐴)‘𝑧))
28	27	eqeq2d 2763	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑧 ∈ 𝐴 → (𝑦 = (inl‘𝑧) ↔ 𝑦 = ((inl ↾ 𝐴)‘𝑧)))
29	28	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (inl‘𝑧) ↔ 𝑦 = ((inl ↾ 𝐴)‘𝑧)))
30		fveq1 6851	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧))
31	30	ad2antrr 734	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧))
32		inlresf 9858	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)
33		ffn 6676	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) → (inl ↾ 𝐴) Fn 𝐴)
34	32, 33	mp1i 13	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) → (inl ↾ 𝐴) Fn 𝐴)
35		fvco2 6949	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
36	34, 35	sylan 588	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
37		fvco2 6949	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
38	34, 37	sylan 588	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
39	31, 36, 38	3eqtr3d 2795	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
40		fveq2 6852	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
41		fveq2 6852	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → (𝑘‘𝑦) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
42	40, 41	eqeq12d 2768	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)) = (𝑘‘((inl ↾ 𝐴)‘𝑧))))
43	39, 42	syl5ibrcom 249	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = ((inl ↾ 𝐴)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
44	29, 43	sylbid 242	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (inl‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
45	44	expimpd 456	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
46	45	ex 415	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
47	46	eqcoms 2760	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
48	25, 47	biimtrrdi 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
49	48	com23 86	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → (𝜑 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
50	49	3ad2ant2 1143	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝜑 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
51	50	impcom 410	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
52	51	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
53	52	3ad2ant2 1143	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
54	53	impcom 410	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
55	54	com12 32	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
56	55	rexlimiva 3145	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
57		eqeq2 2764	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑘 ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) ↔ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺))
58		fvres 6871	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑧 ∈ 𝐵 → ((inr ↾ 𝐵)‘𝑧) = (inr‘𝑧))
59	58	eqcomd 2758	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑧 ∈ 𝐵 → (inr‘𝑧) = ((inr ↾ 𝐵)‘𝑧))
60	59	eqeq2d 2763	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑧 ∈ 𝐵 → (𝑦 = (inr‘𝑧) ↔ 𝑦 = ((inr ↾ 𝐵)‘𝑧)))
61	60	adantl 484	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = (inr‘𝑧) ↔ 𝑦 = ((inr ↾ 𝐵)‘𝑧)))
62		fveq1 6851	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧))
63	62	ad2antrr 734	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧))
64		inrresf 9860	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵)
65		ffn 6676	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵) Fn 𝐵)
66	64, 65	mp1i 13	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) → (inr ↾ 𝐵) Fn 𝐵)
67		fvco2 6949	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
68	66, 67	sylan 588	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
69		fvco2 6949	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
70	66, 69	sylan 588	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
71	63, 68, 70	3eqtr3d 2795	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
72		fveq2 6852	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
73		fveq2 6852	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → (𝑘‘𝑦) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
74	72, 73	eqeq12d 2768	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)) = (𝑘‘((inr ↾ 𝐵)‘𝑧))))
75	71, 74	syl5ibrcom 249	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = ((inr ↾ 𝐵)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
76	61, 75	sylbid 242	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = (inr‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
77	76	expimpd 456	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
78	77	ex 415	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
79	78	eqcoms 2760	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
80	57, 79	biimtrrdi 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
81	80	com23 86	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → (𝜑 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
82	81	3ad2ant3 1144	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝜑 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
83	82	impcom 410	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
84	83	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
85	84	3ad2ant3 1144	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
86	85	impcom 410	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
87	86	com12 32	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
88	87	rexlimiva 3145	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
89	56, 88	jaoi 866	. . . . . . . . . . . 12 ⊢ ((∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) ∨ ∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
90		djur 9863	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝐴 ⊔ 𝐵) → (∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) ∨ ∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧)))
91	89, 90	syl11 33	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑦 ∈ (𝐴 ⊔ 𝐵) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
92	91	ralrimiv 3143	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))
93		ffn 6676	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
94	93	3ad2ant1 1142	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
95	94	adantl 484	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
96		ffn 6676	. . . . . . . . . . . 12 ⊢ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 → 𝑘 Fn (𝐴 ⊔ 𝐵))
97	96	3ad2ant1 1142	. . . . . . . . . . 11 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → 𝑘 Fn (𝐴 ⊔ 𝐵))
98		eqfnfv 6996	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵) ∧ 𝑘 Fn (𝐴 ⊔ 𝐵)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘 ↔ ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
99	95, 97, 98	syl2an 604	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘 ↔ ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
100	92, 99	mpbird 259	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘)
101	100	ex 415	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))
102	101	ralrimivw 3148	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))
103	24, 102	jca 518	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘)))
104	103	ex 415	. . . . 5 ⊢ (𝜑 → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘))))
105	21, 22, 23, 104	mp3and 1475	. . . 4 ⊢ (𝜑 → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥)))) = 𝑘)))
106	6, 17, 105	rspcedvd 3574	. . 3 ⊢ (𝜑 → ∃ℎ ∈ V ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)))
107		feq1 6654	. . . . 5 ⊢ (ℎ = 𝑘 → (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ↔ 𝑘:(𝐴 ⊔ 𝐵)⟶𝐶))
108		coeq1 5818	. . . . . 6 ⊢ (ℎ = 𝑘 → (ℎ ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)))
109	108	eqeq1d 2754	. . . . 5 ⊢ (ℎ = 𝑘 → ((ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ↔ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹))
110		coeq1 5818	. . . . . 6 ⊢ (ℎ = 𝑘 → (ℎ ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)))
111	110	eqeq1d 2754	. . . . 5 ⊢ (ℎ = 𝑘 → ((ℎ ∘ (inr ↾ 𝐵)) = 𝐺 ↔ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺))
112	107, 109, 111	3anbi123d 1447	. . . 4 ⊢ (ℎ = 𝑘 → ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)))
113	112	reu8 3686	. . 3 ⊢ (∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ∃ℎ ∈ V ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)))
114	106, 113	sylibr 236	. 2 ⊢ (𝜑 → ∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))
115		reuv 3472	. 2 ⊢ (∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ∃!ℎ(ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))
116	114, 115	sylib 220	1 ⊢ (𝜑 → ∃!ℎ(ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 856   ∧ w3a 1095   = wceq 1550   ∈ wcel 2132  ∃!weu 2585  ∀wral 3066  ∃wrex 3076  ∃!wreu 3355  Vcvv 3444  ∅c0 4276  ifcif 4470   ↦ cmpt 5171   ↾ cres 5638   ∘ ccom 5640   Fn wfn 6501  ⟶wf 6502  ‘cfv 6506  1^st c1st 7953  2^nd c2nd 7954   ⊔ cdju 9842  inlcinl 9843  inrcinr 9844

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-10 2165  ax-11 2181  ax-12 2202  ax-ext 2724  ax-rep 5217  ax-sep 5236  ax-nul 5246  ax-pow 5312  ax-pr 5380  ax-un 7703

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3or 1096  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-nf 1794  df-sb 2081  df-mo 2556  df-eu 2586  df-clab 2731  df-cleq 2744  df-clel 2827  df-nfc 2901  df-ne 2948  df-ral 3067  df-rex 3077  df-reu 3358  df-rab 3405  df-v 3446  df-sbc 3736  df-csb 3844  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-pss 3915  df-nul 4277  df-if 4471  df-pw 4547  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4856  df-iun 4941  df-br 5091  df-opab 5153  df-mpt 5172  df-tr 5198  df-id 5531  df-eprel 5536  df-po 5544  df-so 5545  df-fr 5589  df-we 5591  df-xp 5642  df-rel 5643  df-cnv 5644  df-co 5645  df-dm 5646  df-rn 5647  df-res 5648  df-ima 5649  df-ord 6334  df-on 6335  df-lim 6336  df-suc 6337  df-iota 6462  df-fun 6508  df-fn 6509  df-f 6510  df-f1 6511  df-fo 6512  df-f1o 6513  df-fv 6514  df-om 7832  df-1st 7955  df-2nd 7956  df-1o 8421  df-dju 9845  df-inl 9846  df-inr 9847

This theorem is referenced by: (None)