updjud - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > updjud		Structured version Visualization version GIF version

Theorem updjud 9925

Description: Universal property of the disjoint union. This theorem shows that the disjoint union, together with the left and right injections df-inl 9893 and df-inr 9894, is the coproduct in the category of sets, see Wikipedia "Coproduct", https://en.wikipedia.org/wiki/Coproduct 9894 (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 513	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊))
4		djuex 9899	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ⊔ 𝐵) ∈ V)
5		mptexg 7218	. . . . 5 ⊢ ((𝐴 ⊔ 𝐵) ∈ V → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∈ V)
6	3, 4, 5	3syl 18	. . . 4 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∈ V)
7		feq1 6695	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ↔ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶))
8		coeq1 5855	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (ℎ ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)))
9	8	eqeq1d 2735	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → ((ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹))
10		coeq1 5855	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (ℎ ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)))
11	10	eqeq1d 2735	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → ((ℎ ∘ (inr ↾ 𝐵)) = 𝐺 ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺))
12	7, 9, 11	3anbi123d 1437	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)))
13		eqeq1 2737	. . . . . . . 8 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (ℎ = 𝑘 ↔ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))
14	13	imbi2d 341	. . . . . . 7 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘) ↔ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘)))
15	14	ralbidv 3178	. . . . . 6 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘) ↔ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘)))
16	12, 15	anbi12d 632	. . . . 5 ⊢ (ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) → (((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)) ↔ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))))
17	16	adantl 483	. . . 4 ⊢ ((𝜑 ∧ ℎ = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))) → (((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)) ↔ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))))
18		updjud.f	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐶)
19		updjud.g	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐵⟶𝐶)
20		eqid 2733	. . . . . 6 ⊢ (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))
21	18, 19, 20	updjudhf 9922	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶)
22	18, 19, 20	updjudhcoinlf 9923	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹)
23	18, 19, 20	updjudhcoinrg 9924	. . . . 5 ⊢ (𝜑 → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)
24		simpr 486	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺))
25		eqeq2 2745	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑘 ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) ↔ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹))
26		fvres 6907	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑧 ∈ 𝐴 → ((inl ↾ 𝐴)‘𝑧) = (inl‘𝑧))
27	26	eqcomd 2739	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑧 ∈ 𝐴 → (inl‘𝑧) = ((inl ↾ 𝐴)‘𝑧))
28	27	eqeq2d 2744	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑧 ∈ 𝐴 → (𝑦 = (inl‘𝑧) ↔ 𝑦 = ((inl ↾ 𝐴)‘𝑧)))
29	28	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (inl‘𝑧) ↔ 𝑦 = ((inl ↾ 𝐴)‘𝑧)))
30		fveq1 6887	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧))
31	30	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧))
32		inlresf 9905	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)
33		ffn 6714	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) → (inl ↾ 𝐴) Fn 𝐴)
34	32, 33	mp1i 13	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) → (inl ↾ 𝐴) Fn 𝐴)
35		fvco2 6984	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
36	34, 35	sylan 581	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
37		fvco2 6984	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
38	34, 37	sylan 581	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → ((𝑘 ∘ (inl ↾ 𝐴))‘𝑧) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
39	31, 36, 38	3eqtr3d 2781	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
40		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)))
41		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → (𝑘‘𝑦) = (𝑘‘((inl ↾ 𝐴)‘𝑧)))
42	40, 41	eqeq12d 2749	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 = ((inl ↾ 𝐴)‘𝑧) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inl ↾ 𝐴)‘𝑧)) = (𝑘‘((inl ↾ 𝐴)‘𝑧))))
43	39, 42	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = ((inl ↾ 𝐴)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
44	29, 43	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐴) → (𝑦 = (inl‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
45	44	expimpd 455	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) ∧ 𝜑) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
46	45	ex 414	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)) → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
47	46	eqcoms 2741	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∘ (inl ↾ 𝐴)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
48	25, 47	syl6bir 254	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → (𝜑 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
49	48	com23 86	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 → (𝜑 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
50	49	3ad2ant2 1135	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝜑 → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
51	50	impcom 409	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
52	51	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
53	52	3ad2ant2 1135	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
54	53	impcom 409	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
55	54	com12 32	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐴 ∧ 𝑦 = (inl‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
56	55	rexlimiva 3148	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
57		eqeq2 2745	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑘 ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) ↔ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺))
58		fvres 6907	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (𝑧 ∈ 𝐵 → ((inr ↾ 𝐵)‘𝑧) = (inr‘𝑧))
59	58	eqcomd 2739	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑧 ∈ 𝐵 → (inr‘𝑧) = ((inr ↾ 𝐵)‘𝑧))
60	59	eqeq2d 2744	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑧 ∈ 𝐵 → (𝑦 = (inr‘𝑧) ↔ 𝑦 = ((inr ↾ 𝐵)‘𝑧)))
61	60	adantl 483	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = (inr‘𝑧) ↔ 𝑦 = ((inr ↾ 𝐵)‘𝑧)))
62		fveq1 6887	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧))
63	62	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧))
64		inrresf 9907	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ (inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵)
65		ffn 6714	. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 ⊢ ((inr ↾ 𝐵):𝐵⟶(𝐴 ⊔ 𝐵) → (inr ↾ 𝐵) Fn 𝐵)
66	64, 65	mp1i 13	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) → (inr ↾ 𝐵) Fn 𝐵)
67		fvco2 6984	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
68	66, 67	sylan 581	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵))‘𝑧) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
69		fvco2 6984	. . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 ⊢ (((inr ↾ 𝐵) Fn 𝐵 ∧ 𝑧 ∈ 𝐵) → ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
70	66, 69	sylan 581	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → ((𝑘 ∘ (inr ↾ 𝐵))‘𝑧) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
71	63, 68, 70	3eqtr3d 2781	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
72		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)))
73		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → (𝑘‘𝑦) = (𝑘‘((inr ↾ 𝐵)‘𝑧)))
74	72, 73	eqeq12d 2749	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝑦 = ((inr ↾ 𝐵)‘𝑧) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦) ↔ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘((inr ↾ 𝐵)‘𝑧)) = (𝑘‘((inr ↾ 𝐵)‘𝑧))))
75	71, 74	syl5ibrcom 246	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = ((inr ↾ 𝐵)‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
76	61, 75	sylbid 239	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) ∧ 𝑧 ∈ 𝐵) → (𝑦 = (inr‘𝑧) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
77	76	expimpd 455	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) ∧ 𝜑) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
78	77	ex 414	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)) → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
79	78	eqcoms 2741	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∘ (inr ↾ 𝐵)) = ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
80	57, 79	syl6bir 254	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → (𝜑 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
81	80	com23 86	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺 → (𝜑 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
82	81	3ad2ant3 1136	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝜑 → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))))
83	82	impcom 409	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
84	83	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∘ (inr ↾ 𝐵)) = 𝐺 → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
85	84	3ad2ant3 1136	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))))
86	85	impcom 409	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
87	86	com12 32	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝐵 ∧ 𝑦 = (inr‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
88	87	rexlimiva 3148	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
89	56, 88	jaoi 856	. . . . . . . . . . . 12 ⊢ ((∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) ∨ ∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧)) → (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
90		djur 9910	. . . . . . . . . . . 12 ⊢ (𝑦 ∈ (𝐴 ⊔ 𝐵) → (∃𝑧 ∈ 𝐴 𝑦 = (inl‘𝑧) ∨ ∃𝑧 ∈ 𝐵 𝑦 = (inr‘𝑧)))
91	89, 90	syl11 33	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑦 ∈ (𝐴 ⊔ 𝐵) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
92	91	ralrimiv 3146	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦))
93		ffn 6714	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
94	93	3ad2ant1 1134	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
95	94	adantl 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵))
96		ffn 6714	. . . . . . . . . . . 12 ⊢ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 → 𝑘 Fn (𝐴 ⊔ 𝐵))
97	96	3ad2ant1 1134	. . . . . . . . . . 11 ⊢ ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → 𝑘 Fn (𝐴 ⊔ 𝐵))
98		eqfnfv 7028	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) Fn (𝐴 ⊔ 𝐵) ∧ 𝑘 Fn (𝐴 ⊔ 𝐵)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘 ↔ ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
99	95, 97, 98	syl2an 597	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘 ↔ ∀𝑦 ∈ (𝐴 ⊔ 𝐵)((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥))))‘𝑦) = (𝑘‘𝑦)))
100	92, 99	mpbird 257	. . . . . . . . 9 ⊢ (((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) ∧ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘)
101	100	ex 414	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))
102	101	ralrimivw 3151	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))
103	24, 102	jca 513	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺)) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘)))
104	103	ex 414	. . . . 5 ⊢ (𝜑 → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘))))
105	21, 22, 23, 104	mp3and 1465	. . . 4 ⊢ (𝜑 → (((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))):(𝐴 ⊔ 𝐵)⟶𝐶 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inl ↾ 𝐴)) = 𝐹 ∧ ((𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1^st ‘𝑥) = ∅, (𝐹‘(2^nd ‘𝑥)), (𝐺‘(2^nd ‘𝑥)))) = 𝑘)))
106	6, 17, 105	rspcedvd 3614	. . 3 ⊢ (𝜑 → ∃ℎ ∈ V ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)))
107		feq1 6695	. . . . 5 ⊢ (ℎ = 𝑘 → (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ↔ 𝑘:(𝐴 ⊔ 𝐵)⟶𝐶))
108		coeq1 5855	. . . . . 6 ⊢ (ℎ = 𝑘 → (ℎ ∘ (inl ↾ 𝐴)) = (𝑘 ∘ (inl ↾ 𝐴)))
109	108	eqeq1d 2735	. . . . 5 ⊢ (ℎ = 𝑘 → ((ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ↔ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹))
110		coeq1 5855	. . . . . 6 ⊢ (ℎ = 𝑘 → (ℎ ∘ (inr ↾ 𝐵)) = (𝑘 ∘ (inr ↾ 𝐵)))
111	110	eqeq1d 2735	. . . . 5 ⊢ (ℎ = 𝑘 → ((ℎ ∘ (inr ↾ 𝐵)) = 𝐺 ↔ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺))
112	107, 109, 111	3anbi123d 1437	. . . 4 ⊢ (ℎ = 𝑘 → ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ (𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺)))
113	112	reu8 3728	. . 3 ⊢ (∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ∃ℎ ∈ V ((ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ∧ ∀𝑘 ∈ V ((𝑘:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (𝑘 ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (𝑘 ∘ (inr ↾ 𝐵)) = 𝐺) → ℎ = 𝑘)))
114	106, 113	sylibr 233	. 2 ⊢ (𝜑 → ∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))
115		reuv 3501	. 2 ⊢ (∃!ℎ ∈ V (ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺) ↔ ∃!ℎ(ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))
116	114, 115	sylib 217	1 ⊢ (𝜑 → ∃!ℎ(ℎ:(𝐴 ⊔ 𝐵)⟶𝐶 ∧ (ℎ ∘ (inl ↾ 𝐴)) = 𝐹 ∧ (ℎ ∘ (inr ↾ 𝐵)) = 𝐺))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∃!weu 2563 ∀wral 3062 ∃wrex 3071 ∃!wreu 3375 Vcvv 3475 ∅c0 4321 ifcif 4527 ↦ cmpt 5230 ↾ cres 5677 ∘ ccom 5679 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 1^st c1st 7968 2^nd c2nd 7969 ⊔ cdju 9889 inlcinl 9890 inrcinr 9891

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7720

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-om 7851 df-1st 7970 df-2nd 7971 df-1o 8461 df-dju 9892 df-inl 9893 df-inr 9894

This theorem is referenced by: (None)

W3C validator