ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  riotass2 GIF version

Theorem riotass2 6067
Description: Restriction of a unique element to a smaller class. (Contributed by NM, 21-Aug-2011.) (Revised by NM, 22-Mar-2013.)
Assertion
Ref Expression
riotass2 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥 ∈ 𝐵 𝜓))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem riotass2
StepHypRef Expression
1 reuss2 3513 . . . 4 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ∃!𝑥 ∈ 𝐴 𝜑)
2 simplr 533 . . . 4 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓))
3 riotasbc 6055 . . . . 5 (∃!𝑥 ∈ 𝐴 𝜑 → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜑)
4 riotacl 6054 . . . . . 6 (∃!𝑥 ∈ 𝐴 𝜑 → (℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴)
5 rspsbc 3135 . . . . . . 7 ((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥](𝜑 → 𝜓)))
6 sbcimg 3093 . . . . . . 7 ((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴 → ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥](𝜑 → 𝜓) ↔ ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜑 → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓)))
75, 6sylibd 149 . . . . . 6 ((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜑 → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓)))
84, 7syl 14 . . . . 5 (∃!𝑥 ∈ 𝐴 𝜑 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜑 → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓)))
93, 8mpid 42 . . . 4 (∃!𝑥 ∈ 𝐴 𝜑 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓))
101, 2, 9sylc 62 . . 3 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓)
111, 4syl 14 . . . . 5 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → (℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴)
12 ssel 3242 . . . . . 6 (𝐴 ⊆ 𝐵 → ((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴 → (℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐵))
1312ad2antrr 492 . . . . 5 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐴 → (℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐵))
1411, 13mpd 13 . . . 4 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → (℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐵)
15 simprr 537 . . . 4 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ∃!𝑥 ∈ 𝐵 𝜓)
16 nfriota1 6046 . . . . 5 Ⅎ𝑥(℩𝑥 ∈ 𝐴 𝜑)
1716nfsbc1 3069 . . . . 5 Ⅎ𝑥[(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓
18 sbceq1a 3061 . . . . 5 (𝑥 = (℩𝑥 ∈ 𝐴 𝜑) → (𝜓 ↔ [(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓))
1916, 17, 18riota2f 6061 . . . 4 (((℩𝑥 ∈ 𝐴 𝜑) ∈ 𝐵 ∧ ∃!𝑥 ∈ 𝐵 𝜓) → ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓 ↔ (℩𝑥 ∈ 𝐵 𝜓) = (℩𝑥 ∈ 𝐴 𝜑)))
2014, 15, 19syl2anc 415 . . 3 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → ([(℩𝑥 ∈ 𝐴 𝜑) / 𝑥]𝜓 ↔ (℩𝑥 ∈ 𝐵 𝜓) = (℩𝑥 ∈ 𝐴 𝜑)))
2110, 20mpbid 147 . 2 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → (℩𝑥 ∈ 𝐵 𝜓) = (℩𝑥 ∈ 𝐴 𝜑))
2221eqcomd 2244 1 (((𝐴 ⊆ 𝐵 ∧ ∀𝑥 ∈ 𝐴 (𝜑 → 𝜓)) ∧ (∃𝑥 ∈ 𝐴 𝜑 ∧ ∃!𝑥 ∈ 𝐵 𝜓)) → (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥 ∈ 𝐵 𝜓))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ∃!wreu 2530  [wsbc 3051   ⊆ wss 3220  ℩crio 6037
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-ext 2220
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-sn 3715  df-pr 3716  df-uni 3936  df-iota 5337  df-riota 6038
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator