Theorem riotasv3d 40220

Description: A property 𝜒 holding for a representative of a single-valued class expression 𝐶(𝑦) (see e.g. reusv2 5370) 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 3475	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2		riotasv3d.7	. . . 4 ⊢ (𝜑 → ∃𝑦 ∈ 𝐵 𝜓)
3	2	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ∃𝑦 ∈ 𝐵 𝜓)
4		riotasv3d.1	. . . . . 6 ⊢ Ⅎ𝑦𝜑
5		nfv 1949	. . . . . 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 40216	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝐷 = 𝐶))
12	11	impr 460	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝐴 ∈ V ∧ (𝑦 ∈ 𝐵 ∧ 𝜓))) → 𝐷 = 𝐶)
13	12	eqcomd 2769	. . . . . . . . 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 3271	. . . . 5 ⊢ (𝜑 → (𝐴 ∈ V → ∀𝑦 ∈ 𝐵 (𝜓 → 𝜃)))
19		riotasv3d.2	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑦𝜃)
20		r19.23t 3262	. . . . . 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 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454  ℩crio 7402

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-riotaBAD 40213

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-iota 6515  df-fun 6563  df-fv 6569  df-riota 7403  df-undef 8321

This theorem is used by:  cdlemefs32sn1aw  41674  cdleme43fsv1snlem  41680  cdleme41sn3a  41693  cdleme40m  41727  cdleme40n  41728  cdlemkid  42196  dihvalcqpre  42495