Theorem riotasv3d 39775

Description: A property 𝜒 holding for a representative of a single-valued class expression 𝐶(𝑦) (see e.g. reusv2 5379) also holds for its description binder 𝐷 (in the form of property 𝜃). (Contributed by NM, 5-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
riotasv3d.1	⊢ Ⅎ𝑦𝜑
riotasv3d.2	⊢ (𝜑 → Ⅎ𝑦𝜃)
riotasv3d.3	⊢ (𝜑 → 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶)))
riotasv3d.4	⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝜒 ↔ 𝜃))
riotasv3d.5	⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝜒))
riotasv3d.6	⊢ (𝜑 → 𝐷 ∈ 𝐴)
riotasv3d.7	⊢ (𝜑 → ∃𝑦 ∈ 𝐵 𝜓)

Assertion

Ref	Expression
riotasv3d	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → 𝜃)

Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑦)   𝜒(𝑥, 𝑦)   𝜃(𝑥, 𝑦)   𝐵(𝑦)   𝐶(𝑦)   𝐷(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem riotasv3d

Step	Hyp	Ref	Expression
1		elex 3479	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2		riotasv3d.7	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ 𝐵 𝜓)
3	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ∃𝑦 ∈ 𝐵 𝜓)
4		riotasv3d.1	. . . . . 6 ⊢ Ⅎ𝑦𝜑
5		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑦 𝐴 ∈ V
6		riotasv3d.5	. . . . . . . . . 10 ⊢ (𝜑 → ((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝜒))
7	6	imp 412	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐵 ∧ 𝜓)) → 𝜒)
8	7	adantrl 729	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → 𝜒)
9		riotasv3d.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶)))
10		riotasv3d.6	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ∈ 𝐴)
11	9, 10	riotasvd 39771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝐷 = 𝐶))
12	11	impr 460	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → 𝐷 = 𝐶)
13	12	eqcomd 2772	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → 𝐶 = 𝐷)
14		riotasv3d.4	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐶 = 𝐷) → (𝜒 ↔ 𝜃))
15	13, 14	syldan 603	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → (𝜒 ↔ 𝜃))
16	8, 15	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → 𝜃)
17	16	exp45 444	. . . . . 6 ⊢ (𝜑 → (𝐴 ∈ V → (𝑦 ∈ 𝐵 → (𝜓 → 𝜃))))
18	4, 5, 17	ralrimd 3273	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ V → ∀𝑦 ∈ 𝐵 (𝜓 → 𝜃)))
19		riotasv3d.2	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑦𝜃)
20		r19.23t 3264	. . . . . 6 ⊢ (Ⅎ𝑦𝜃 → (∀𝑦 ∈ 𝐵 (𝜓 → 𝜃) ↔ (∃𝑦 ∈ 𝐵 𝜓 → 𝜃)))
21	19, 20	syl 18	. . . . 5 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 (𝜓 → 𝜃) ↔ (∃𝑦 ∈ 𝐵 𝜓 → 𝜃)))
22	18, 21	sylibd 242	. . . 4 ⊢ (𝜑 → (𝐴 ∈ V → (∃𝑦 ∈ 𝐵 𝜓 → 𝜃)))
23	22	imp 412	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → (∃𝑦 ∈ 𝐵 𝜓 → 𝜃))
24	3, 23	mpd 16	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → 𝜃)
25	1, 24	sylan2 605	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → 𝜃)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146  ∀wral 3082  ∃wrex 3092  Vcvv 3458  ℩crio 7379

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-riotaBAD 39768

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ral 3083  df-rex 3093  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-riota 7380  df-undef 8278

This theorem is used by:  cdlemefs32sn1aw  41229  cdleme43fsv1snlem  41235  cdleme41sn3a  41248  cdleme40m  41282  cdleme40n  41283  cdlemkid  41751  dihvalcqpre  42050