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

Theorem reupick2 3463
Description: Restricted uniqueness "picks" a member of a subclass. (Contributed by Mario Carneiro, 15-Dec-2013.) (Proof shortened by Mario Carneiro, 19-Nov-2016.)
Assertion
Ref Expression
reupick2 (((∀𝑥𝐴 (𝜓𝜑) ∧ ∃𝑥𝐴 𝜓 ∧ ∃!𝑥𝐴 𝜑) ∧ 𝑥𝐴) → (𝜑𝜓))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem reupick2
StepHypRef Expression
1 ancr 321 . . . . . 6 ((𝜓𝜑) → (𝜓 → (𝜑𝜓)))
21ralimi 2570 . . . . 5 (∀𝑥𝐴 (𝜓𝜑) → ∀𝑥𝐴 (𝜓 → (𝜑𝜓)))
3 rexim 2601 . . . . 5 (∀𝑥𝐴 (𝜓 → (𝜑𝜓)) → (∃𝑥𝐴 𝜓 → ∃𝑥𝐴 (𝜑𝜓)))
42, 3syl 14 . . . 4 (∀𝑥𝐴 (𝜓𝜑) → (∃𝑥𝐴 𝜓 → ∃𝑥𝐴 (𝜑𝜓)))
5 reupick3 3462 . . . . . 6 ((∃!𝑥𝐴 𝜑 ∧ ∃𝑥𝐴 (𝜑𝜓) ∧ 𝑥𝐴) → (𝜑𝜓))
653exp 1205 . . . . 5 (∃!𝑥𝐴 𝜑 → (∃𝑥𝐴 (𝜑𝜓) → (𝑥𝐴 → (𝜑𝜓))))
76com12 30 . . . 4 (∃𝑥𝐴 (𝜑𝜓) → (∃!𝑥𝐴 𝜑 → (𝑥𝐴 → (𝜑𝜓))))
84, 7syl6 33 . . 3 (∀𝑥𝐴 (𝜓𝜑) → (∃𝑥𝐴 𝜓 → (∃!𝑥𝐴 𝜑 → (𝑥𝐴 → (𝜑𝜓)))))
983imp1 1223 . 2 (((∀𝑥𝐴 (𝜓𝜑) ∧ ∃𝑥𝐴 𝜓 ∧ ∃!𝑥𝐴 𝜑) ∧ 𝑥𝐴) → (𝜑𝜓))
10 rsp 2554 . . . 4 (∀𝑥𝐴 (𝜓𝜑) → (𝑥𝐴 → (𝜓𝜑)))
11103ad2ant1 1021 . . 3 ((∀𝑥𝐴 (𝜓𝜑) ∧ ∃𝑥𝐴 𝜓 ∧ ∃!𝑥𝐴 𝜑) → (𝑥𝐴 → (𝜓𝜑)))
1211imp 124 . 2 (((∀𝑥𝐴 (𝜓𝜑) ∧ ∃𝑥𝐴 𝜓 ∧ ∃!𝑥𝐴 𝜑) ∧ 𝑥𝐴) → (𝜓𝜑))
139, 12impbid 129 1 (((∀𝑥𝐴 (𝜓𝜑) ∧ ∃𝑥𝐴 𝜓 ∧ ∃!𝑥𝐴 𝜑) ∧ 𝑥𝐴) → (𝜑𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 981  wcel 2177  wral 2485  wrex 2486  ∃!wreu 2487
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559
This theorem depends on definitions:  df-bi 117  df-3an 983  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-ral 2490  df-rex 2491  df-reu 2492
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator