Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  riotasv2s Structured version   Visualization version   GIF version

Theorem riotasv2s 40207
Description: The value of description binder 𝐷 for a single-valued class expression 𝐶(𝑦) (as in e.g. reusv2 5369) in the form of a substitution instance. Special case of riota2f 7424. (Contributed by NM, 3-Mar-2013.) (Proof shortened by Mario Carneiro, 6-Dec-2016.)
Hypothesis
Ref Expression
riotasv2s.2 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))
Assertion
Ref Expression
riotasv2s ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐷 = ⦋𝐸 / 𝑦⦌𝐶)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶   𝑥,𝐸,𝑦   𝜑,𝑥
Allowed substitution hints:   𝜑(𝑦)   𝐶(𝑦)   𝐷(𝑥, 𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem riotasv2s
StepHypRef Expression
1 3simpc 1168 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → (𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)))
2 simp1 1154 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐴 ∈ 𝑉)
3 riotasv2s.2 . . . . . 6 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))
4 nfra1 3290 . . . . . . 7 Ⅎ𝑦∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)
5 nfcv 2926 . . . . . . 7 Ⅎ𝑦𝐴
64, 5nfriota 7412 . . . . . 6 Ⅎ𝑦(℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶))
73, 6nfcxfr 2924 . . . . 5 Ⅎ𝑦𝐷
87nfel1 2942 . . . 4 Ⅎ𝑦 𝐷 ∈ 𝐴
9 nfv 1949 . . . . 5 Ⅎ𝑦 𝐸 ∈ 𝐵
10 nfsbc1v 3762 . . . . 5 Ⅎ𝑦[𝐸 / 𝑦]𝜑
119, 10nfan 1934 . . . 4 Ⅎ𝑦(𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)
128, 11nfan 1934 . . 3 Ⅎ𝑦(𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑))
13 nfcsb1v 3875 . . . 4 Ⅎ𝑦⦋𝐸 / 𝑦⦌𝐶
1413a1i 11 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → Ⅎ𝑦⦋𝐸 / 𝑦⦌𝐶)
1510a1i 11 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → Ⅎ𝑦[𝐸 / 𝑦]𝜑)
163a1i 11 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐷 = (℩𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐵 (𝜑 → 𝑥 = 𝐶)))
17 sbceq1a 3753 . . . 4 (𝑦 = 𝐸 → (𝜑 ↔ [𝐸 / 𝑦]𝜑))
1817adantl 487 . . 3 (((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) ∧ 𝑦 = 𝐸) → (𝜑 ↔ [𝐸 / 𝑦]𝜑))
19 csbeq1a 3865 . . . 4 (𝑦 = 𝐸 → 𝐶 = ⦋𝐸 / 𝑦⦌𝐶)
2019adantl 487 . . 3 (((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) ∧ 𝑦 = 𝐸) → 𝐶 = ⦋𝐸 / 𝑦⦌𝐶)
21 simpl 488 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐷 ∈ 𝐴)
22 simprl 783 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐸 ∈ 𝐵)
23 simprr 785 . . 3 ((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → [𝐸 / 𝑦]𝜑)
2412, 14, 15, 16, 18, 20, 21, 22, 23riotasv2d 40206 . 2 (((𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) ∧ 𝐴 ∈ 𝑉) → 𝐷 = ⦋𝐸 / 𝑦⦌𝐶)
251, 2, 24syl2anc 596 1 ((𝐴 ∈ 𝑉 ∧ 𝐷 ∈ 𝐴 ∧ (𝐸 ∈ 𝐵 ∧ [𝐸 / 𝑦]𝜑)) → 𝐷 = ⦋𝐸 / 𝑦⦌𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2147  Ⅎwnfc 2911  ∀wral 3080  [wsbc 3742  ⦋csb 3851  ℩crio 7399
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 5252  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-riotaBAD 40202
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-csb 3852  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 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6512  df-fun 6560  df-fv 6566  df-riota 7400  df-undef 8318
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator