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

Theorem rmob 3145
Description: Consequence of "at most one", using implicit substitution. (Contributed by NM, 2-Jan-2015.) (Revised by NM, 16-Jun-2017.)
Hypotheses
Ref Expression
rmoi.b (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
rmoi.c (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))
Assertion
Ref Expression
rmob ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜓,𝑥   𝜒,𝑥
Allowed substitution hint:   𝜑(𝑥)

Proof of Theorem rmob
StepHypRef Expression
1 df-rmo 2536 . 2 (∃*𝑥 ∈ 𝐴 𝜑 ↔ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
2 simprl 535 . . . 4 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → 𝐵 ∈ 𝐴)
3 eleq1 2301 . . . 4 (𝐵 = 𝐶 → (𝐵 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
42, 3syl5ibcom 155 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 → 𝐶 ∈ 𝐴))
5 simpl 109 . . . 4 ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴)
65a1i 9 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → ((𝐶 ∈ 𝐴 ∧ 𝜒) → 𝐶 ∈ 𝐴))
7 simplrl 541 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝐵 ∈ 𝐴)
8 simpr 110 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝐶 ∈ 𝐴)
9 simpll 531 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))
10 simplrr 542 . . . . 5 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → 𝜓)
11 eleq1 2301 . . . . . . 7 (𝑥 = 𝐵 → (𝑥 ∈ 𝐴 ↔ 𝐵 ∈ 𝐴))
12 rmoi.b . . . . . . 7 (𝑥 = 𝐵 → (𝜑 ↔ 𝜓))
1311, 12anbi12d 477 . . . . . 6 (𝑥 = 𝐵 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐵 ∈ 𝐴 ∧ 𝜓)))
14 eleq1 2301 . . . . . . 7 (𝑥 = 𝐶 → (𝑥 ∈ 𝐴 ↔ 𝐶 ∈ 𝐴))
15 rmoi.c . . . . . . 7 (𝑥 = 𝐶 → (𝜑 ↔ 𝜒))
1614, 15anbi12d 477 . . . . . 6 (𝑥 = 𝐶 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
1713, 16mob 3008 . . . . 5 (((𝐵 ∈ 𝐴 ∧ 𝐶 ∈ 𝐴) ∧ ∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
187, 8, 9, 7, 10, 17syl212anc 1288 . . . 4 (((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) ∧ 𝐶 ∈ 𝐴) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
1918ex 115 . . 3 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐶 ∈ 𝐴 → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒))))
204, 6, 19pm5.21ndd 717 . 2 ((∃*𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
211, 20sylanb 284 1 ((∃*𝑥 ∈ 𝐴 𝜑 ∧ (𝐵 ∈ 𝐴 ∧ 𝜓)) → (𝐵 = 𝐶 ↔ (𝐶 ∈ 𝐴 ∧ 𝜒)))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402  ∃*wmo 2087   ∈ wcel 2209  ∃*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-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-rmo 2536  df-v 2823
This theorem is used by:  rmoi  3146
  Copyright terms: Public domain W3C validator