Theorem bropfvvvv 8028

Description: If a binary relation holds for the result of an operation which is a function value, the involved classes are sets. (Contributed by AV, 31-Dec-2020.) (Revised by AV, 16-Jan-2021.)

Hypotheses

Ref	Expression
bropfvvvv.o	⊢ 𝑂 = (𝑎 ∈ 𝑈 ↦ (𝑏 ∈ 𝑉, 𝑐 ∈ 𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
bropfvvvv.oo	⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) → (𝐵(𝑂‘𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
bropfvvvv.s	⊢ (𝑎 = 𝐴 → 𝑉 = 𝑆)
bropfvvvv.t	⊢ (𝑎 = 𝐴 → 𝑊 = 𝑇)
bropfvvvv.p	⊢ (𝑎 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
bropfvvvv	⊢ ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))

Distinct variable groups:   𝑈,𝑎   𝐴,𝑎,𝑏,𝑐,𝑑,𝑒   𝑆,𝑎,𝑏,𝑐   𝑇,𝑎,𝑏,𝑐   𝜓,𝑎

Allowed substitution hints:   𝜑(𝑒,𝑎,𝑏,𝑐,𝑑)   𝜓(𝑒,𝑏,𝑐,𝑑)   𝜃(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐵(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐶(𝑒,𝑎,𝑏,𝑐,𝑑)   𝐷(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑆(𝑒,𝑑)   𝑇(𝑒,𝑑)   𝑈(𝑒,𝑏,𝑐,𝑑)   𝐸(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑂(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑉(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑊(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑋(𝑒,𝑎,𝑏,𝑐,𝑑)   𝑌(𝑒,𝑎,𝑏,𝑐,𝑑)

Proof of Theorem bropfvvvv

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		brovpreldm 8025	. 2 ⊢ (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → ⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴))
2		bropfvvvv.s	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → 𝑉 = 𝑆)
3		bropfvvvv.t	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → 𝑊 = 𝑇)
4		bropfvvvv.p	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐴 → (𝜑 ↔ 𝜓))
5	4	opabbidv 5159	. . . . . . . . . 10 ⊢ (𝑎 = 𝐴 → {⟨𝑑, 𝑒⟩ ∣ 𝜑} = {⟨𝑑, 𝑒⟩ ∣ 𝜓})
6	2, 3, 5	mpoeq123dv 7427	. . . . . . . . 9 ⊢ (𝑎 = 𝐴 → (𝑏 ∈ 𝑉, 𝑐 ∈ 𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}) = (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}))
7		bropfvvvv.o	. . . . . . . . 9 ⊢ 𝑂 = (𝑎 ∈ 𝑈 ↦ (𝑏 ∈ 𝑉, 𝑐 ∈ 𝑊 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜑}))
8	6, 7	fvmptg 6933	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → (𝑂‘𝐴) = (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}))
9	8	dmeqd 5849	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → dom (𝑂‘𝐴) = dom (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}))
10	9	eleq2d 2819	. . . . . 6 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) ↔ ⟨𝐵, 𝐶⟩ ∈ dom (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓})))
11		dmoprabss 7456	. . . . . . . . 9 ⊢ dom {⟨⟨𝑏, 𝑐⟩, 𝑧⟩ ∣ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑇) ∧ 𝑧 = {⟨𝑑, 𝑒⟩ ∣ 𝜓})} ⊆ (𝑆 × 𝑇)
12	11	sseli 3926	. . . . . . . 8 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom {⟨⟨𝑏, 𝑐⟩, 𝑧⟩ ∣ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑇) ∧ 𝑧 = {⟨𝑑, 𝑒⟩ ∣ 𝜓})} → ⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇))
13		bropfvvvv.oo	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) → (𝐵(𝑂‘𝐴)𝐶) = {⟨𝑑, 𝑒⟩ ∣ 𝜃})
14	7, 13	bropfvvvvlem 8027	. . . . . . . . 9 ⊢ ((⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) ∧ 𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸) → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))
15	14	ex 412	. . . . . . . 8 ⊢ (⟨𝐵, 𝐶⟩ ∈ (𝑆 × 𝑇) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
16	12, 15	syl 17	. . . . . . 7 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom {⟨⟨𝑏, 𝑐⟩, 𝑧⟩ ∣ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑇) ∧ 𝑧 = {⟨𝑑, 𝑒⟩ ∣ 𝜓})} → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
17		df-mpo 7357	. . . . . . . 8 ⊢ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) = {⟨⟨𝑏, 𝑐⟩, 𝑧⟩ ∣ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑇) ∧ 𝑧 = {⟨𝑑, 𝑒⟩ ∣ 𝜓})}
18	17	dmeqi 5848	. . . . . . 7 ⊢ dom (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) = dom {⟨⟨𝑏, 𝑐⟩, 𝑧⟩ ∣ ((𝑏 ∈ 𝑆 ∧ 𝑐 ∈ 𝑇) ∧ 𝑧 = {⟨𝑑, 𝑒⟩ ∣ 𝜓})}
19	16, 18	eleq2s 2851	. . . . . 6 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
20	10, 19	biimtrdi 253	. . . . 5 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
21	20	com23 86	. . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
22	21	a1d 25	. . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
23		ianor 983	. . . . 5 ⊢ (¬ (𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) ↔ (¬ 𝐴 ∈ 𝑈 ∨ ¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V))
24	7	fvmptndm 6966	. . . . . . . . . . 11 ⊢ (¬ 𝐴 ∈ 𝑈 → (𝑂‘𝐴) = ∅)
25	24	dmeqd 5849	. . . . . . . . . 10 ⊢ (¬ 𝐴 ∈ 𝑈 → dom (𝑂‘𝐴) = dom ∅)
26	25	eleq2d 2819	. . . . . . . . 9 ⊢ (¬ 𝐴 ∈ 𝑈 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) ↔ ⟨𝐵, 𝐶⟩ ∈ dom ∅))
27		dm0 5864	. . . . . . . . . 10 ⊢ dom ∅ = ∅
28	27	eleq2i 2825	. . . . . . . . 9 ⊢ (⟨𝐵, 𝐶⟩ ∈ dom ∅ ↔ ⟨𝐵, 𝐶⟩ ∈ ∅)
29	26, 28	bitrdi 287	. . . . . . . 8 ⊢ (¬ 𝐴 ∈ 𝑈 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) ↔ ⟨𝐵, 𝐶⟩ ∈ ∅))
30		noel 4287	. . . . . . . . 9 ⊢ ¬ ⟨𝐵, 𝐶⟩ ∈ ∅
31	30	pm2.21i 119	. . . . . . . 8 ⊢ (⟨𝐵, 𝐶⟩ ∈ ∅ → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))
32	29, 31	biimtrdi 253	. . . . . . 7 ⊢ (¬ 𝐴 ∈ 𝑈 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
33	32	a1d 25	. . . . . 6 ⊢ (¬ 𝐴 ∈ 𝑈 → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
34		notnotb 315	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 ↔ ¬ ¬ 𝐴 ∈ 𝑈)
35		elex 3458	. . . . . . . . . . . . . 14 ⊢ (𝑆 ∈ 𝑋 → 𝑆 ∈ V)
36		elex 3458	. . . . . . . . . . . . . 14 ⊢ (𝑇 ∈ 𝑌 → 𝑇 ∈ V)
37	35, 36	anim12i 613	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝑆 ∈ V ∧ 𝑇 ∈ V))
38	37	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌)) → (𝑆 ∈ V ∧ 𝑇 ∈ V))
39		mpoexga 8015	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ V ∧ 𝑇 ∈ V) → (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V)
40	38, 39	syl 17	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌)) → (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V)
41	40	pm2.24d 151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ 𝑈 ∧ (𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌)) → (¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
42	41	ex 412	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝑈 → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))))
43	42	com23 86	. . . . . . . 8 ⊢ (𝐴 ∈ 𝑈 → (¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))))
44	34, 43	sylbir 235	. . . . . . 7 ⊢ (¬ ¬ 𝐴 ∈ 𝑈 → (¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))))
45	44	imp 406	. . . . . 6 ⊢ ((¬ ¬ 𝐴 ∈ 𝑈 ∧ ¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
46	33, 45	jaoi3 1060	. . . . 5 ⊢ ((¬ 𝐴 ∈ 𝑈 ∨ ¬ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
47	23, 46	sylbi 217	. . . 4 ⊢ (¬ (𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
48	47	com34 91	. . 3 ⊢ (¬ (𝐴 ∈ 𝑈 ∧ (𝑏 ∈ 𝑆, 𝑐 ∈ 𝑇 ↦ {⟨𝑑, 𝑒⟩ ∣ 𝜓}) ∈ V) → ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))))
49	22, 48	pm2.61i 182	. 2 ⊢ ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (⟨𝐵, 𝐶⟩ ∈ dom (𝑂‘𝐴) → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V)))))
50	1, 49	mpdi 45	1 ⊢ ((𝑆 ∈ 𝑋 ∧ 𝑇 ∈ 𝑌) → (𝐷(𝐵(𝑂‘𝐴)𝐶)𝐸 → (𝐴 ∈ 𝑈 ∧ (𝐵 ∈ 𝑆 ∧ 𝐶 ∈ 𝑇) ∧ (𝐷 ∈ V ∧ 𝐸 ∈ V))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  Vcvv 3437  ∅c0 4282  ⟨cop 4581   class class class wbr 5093  {copab 5155   ↦ cmpt 5174   × cxp 5617  dom cdm 5619  ‘cfv 6486  (class class class)co 7352  {coprab 7353   ∈ cmpo 7354

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-1st 7927  df-2nd 7928

This theorem is referenced by:  wlkonprop  29637  wksonproplem  29683