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

Theorem rmo3 3144
Description: Restricted at-most-one quantifier using explicit substitution. (Contributed by NM, 4-Nov-2012.) (Revised by NM, 16-Jun-2017.)
Hypothesis
Ref Expression
rmo2.1 Ⅎ𝑦𝜑
Assertion
Ref Expression
rmo3 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
Distinct variable group:   𝑥,𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem rmo3
StepHypRef Expression
1 df-rmo 2536 . 2 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2 sban 2015 . . . . . . . . . . 11 ([𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑))
3 clelsb1 2343 . . . . . . . . . . . 12 ([𝑦 / 𝑥]𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)
43anbi1i 462 . . . . . . . . . . 11 (([𝑦 / 𝑥]𝑥 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑))
52, 4bitri 184 . . . . . . . . . 10 ([𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑))
65anbi2i 461 . . . . . . . . 9 (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)))
7 an4 592 . . . . . . . . 9 (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝑦 ∈ 𝐴 ∧ [𝑦 / 𝑥]𝜑)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
8 ancom 266 . . . . . . . . . 10 ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
98anbi1i 462 . . . . . . . . 9 (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
106, 7, 93bitri 206 . . . . . . . 8 (((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)))
1110imbi1i 238 . . . . . . 7 ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦))
12 impexp 263 . . . . . . 7 ((((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
13 impexp 263 . . . . . . 7 (((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
1411, 12, 133bitri 206 . . . . . 6 ((((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
1514albii 1523 . . . . 5 (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
16 df-ral 2533 . . . . 5 (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ ∀𝑦(𝑦 ∈ 𝐴 → (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))))
17 r19.21v 2627 . . . . 5 (∀𝑦 ∈ 𝐴 (𝑥 ∈ 𝐴 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
1815, 16, 173bitr2i 208 . . . 4 (∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ (𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
1918albii 1523 . . 3 (∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
20 nfv 1581 . . . . 5 Ⅎ𝑦 𝑥 ∈ 𝐴
21 rmo2.1 . . . . 5 Ⅎ𝑦𝜑
2220, 21nfan 1618 . . . 4 Ⅎ𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)
2322mo3 2141 . . 3 (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥∀𝑦(((𝑥 ∈ 𝐴 ∧ 𝜑) ∧ [𝑦 / 𝑥](𝑥 ∈ 𝐴 ∧ 𝜑)) → 𝑥 = 𝑦))
24 df-ral 2533 . . 3 (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦)))
2519, 23, 243bitr4i 212 . 2 (∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
261, 25bitri 184 1 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400  Ⅎwnf 1513  [wsb 1815  ∃*wmo 2087   ∈ wcel 2209  ∀wral 2528  ∃*wrmo 2531
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-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-cleq 2231  df-clel 2234  df-ral 2533  df-rmo 2536
This theorem is used by:  disjiun  4125
  Copyright terms: Public domain W3C validator