Theorem riotasv2d 38429

Description: Value of description binder 𝐷 for a single-valued class expression 𝐶(𝑦) (as in e.g. reusv2 5403). Special case of riota2f 7401. (Contributed by NM, 2-Mar-2013.)

Hypotheses

Ref	Expression
riotasv2d.1	⊢ Ⅎ𝑦𝜑
riotasv2d.2	⊢ (𝜑 → Ⅎ𝑦𝐹)
riotasv2d.3	⊢ (𝜑 → Ⅎ𝑦𝜒)
riotasv2d.4	⊢ (𝜑 → 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶)))
riotasv2d.5	⊢ ((𝜑 ∧ 𝑦 = 𝐸) → (𝜓 ↔ 𝜒))
riotasv2d.6	⊢ ((𝜑 ∧ 𝑦 = 𝐸) → 𝐶 = 𝐹)
riotasv2d.7	⊢ (𝜑 → 𝐷 ∈ 𝐴)
riotasv2d.8	⊢ (𝜑 → 𝐸 ∈ 𝐵)
riotasv2d.9	⊢ (𝜑 → 𝜒)

Assertion

Ref	Expression
riotasv2d	⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → 𝐷 = 𝐹)

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

Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑦)   𝜒(𝑥,𝑦)   𝐶(𝑦)   𝐷(𝑥,𝑦)   𝐸(𝑥)   𝐹(𝑥,𝑦)   𝑉(𝑥,𝑦)

Proof of Theorem riotasv2d

Step	Hyp	Ref	Expression
1		elex 3490	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
2		riotasv2d.8	. . . 4 ⊢ (𝜑 → 𝐸 ∈ 𝐵)
3	2	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → 𝐸 ∈ 𝐵)
4		riotasv2d.9	. . . 4 ⊢ (𝜑 → 𝜒)
5	4	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → 𝜒)
6		eleq1 2817	. . . . . . . 8 ⊢ (𝑦 = 𝐸 → (𝑦 ∈ 𝐵 ↔ 𝐸 ∈ 𝐵))
7	6	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → (𝑦 ∈ 𝐵 ↔ 𝐸 ∈ 𝐵))
8		riotasv2d.5	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → (𝜓 ↔ 𝜒))
9	7, 8	anbi12d 631	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → ((𝑦 ∈ 𝐵 ∧ 𝜓) ↔ (𝐸 ∈ 𝐵 ∧ 𝜒)))
10		riotasv2d.6	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → 𝐶 = 𝐹)
11	10	eqeq2d 2739	. . . . . 6 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → (𝐷 = 𝐶 ↔ 𝐷 = 𝐹))
12	9, 11	imbi12d 344	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 = 𝐸) → (((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝐷 = 𝐶) ↔ ((𝐸 ∈ 𝐵 ∧ 𝜒) → 𝐷 = 𝐹)))
13	12	adantlr 714	. . . 4 ⊢ (((𝜑 ∧ 𝐴 ∈ V) ∧ 𝑦 = 𝐸) → (((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝐷 = 𝐶) ↔ ((𝐸 ∈ 𝐵 ∧ 𝜒) → 𝐷 = 𝐹)))
14		riotasv2d.4	. . . . 5 ⊢ (𝜑 → 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶)))
15		riotasv2d.7	. . . . 5 ⊢ (𝜑 → 𝐷 ∈ 𝐴)
16	14, 15	riotasvd 38428	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ((𝑦 ∈ 𝐵 ∧ 𝜓) → 𝐷 = 𝐶))
17		riotasv2d.1	. . . . 5 ⊢ Ⅎ𝑦𝜑
18		nfv 1910	. . . . 5 ⊢ Ⅎ𝑦 𝐴 ∈ V
19	17, 18	nfan 1895	. . . 4 ⊢ Ⅎ𝑦(𝜑 ∧ 𝐴 ∈ V)
20		nfcvd 2900	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → Ⅎ𝑦𝐸)
21		nfvd 1911	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦 𝐸 ∈ 𝐵)
22		riotasv2d.3	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦𝜒)
23	21, 22	nfand 1893	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑦(𝐸 ∈ 𝐵 ∧ 𝜒))
24		nfra1 3278	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶)
25		nfcv 2899	. . . . . . . . 9 ⊢ Ⅎ𝑦𝐴
26	24, 25	nfriota 7389	. . . . . . . 8 ⊢ Ⅎ𝑦(℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶))
27	17, 14	nfceqdf 2894	. . . . . . . 8 ⊢ (𝜑 → (Ⅎ𝑦𝐷 ↔ Ⅎ𝑦(℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜓 → 𝑥 = 𝐶))))
28	26, 27	mpbiri 258	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦𝐷)
29		riotasv2d.2	. . . . . . 7 ⊢ (𝜑 → Ⅎ𝑦𝐹)
30	28, 29	nfeqd 2910	. . . . . 6 ⊢ (𝜑 → Ⅎ𝑦 𝐷 = 𝐹)
31	23, 30	nfimd 1890	. . . . 5 ⊢ (𝜑 → Ⅎ𝑦((𝐸 ∈ 𝐵 ∧ 𝜒) → 𝐷 = 𝐹))
32	31	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → Ⅎ𝑦((𝐸 ∈ 𝐵 ∧ 𝜒) → 𝐷 = 𝐹))
33	3, 13, 16, 19, 20, 32	vtocldf 3544	. . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → ((𝐸 ∈ 𝐵 ∧ 𝜒) → 𝐷 = 𝐹))
34	3, 5, 33	mp2and 698	. 2 ⊢ ((𝜑 ∧ 𝐴 ∈ V) → 𝐷 = 𝐹)
35	1, 34	sylan2 592	1 ⊢ ((𝜑 ∧ 𝐴 ∈ 𝑉) → 𝐷 = 𝐹)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1534  Ⅎwnf 1778   ∈ wcel 2099  Ⅎwnfc 2879  ∀wral 3058  Vcvv 3471  ℩crio 7375

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-riotaBAD 38425

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ral 3059  df-rex 3068  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-iota 6500  df-fun 6550  df-fv 6556  df-riota 7376  df-undef 8279

This theorem is referenced by:  riotasv2s  38430  cdleme42b  39951

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »