HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem eueq3 1430
Description: Equality has existential uniqueness (split into 3 cases).
Hypotheses
Ref Expression
eueq3.1 AV
eueq3.2 BV
eueq3.3 CV
eueq3.4 ¬ (φψ)
Assertion
Ref Expression
eueq3 ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))
Distinct variable group(s):   φ,x   ψ,x   x,A   x,B   x,C

Proof of Theorem eueq3
StepHypRef Expression
1 euorv 1025 . . . 4 ((¬ (¬ (φψ) ∨ ψ) ∧ ∃!x(φx = A)) → ∃!x((¬ (φψ) ∨ ψ) ∨ (φx = A)))
2 pm2.45 228 . . . . . 6 (¬ (φψ) → ¬ φ)
3 eueq3.4 . . . . . . . 8 ¬ (φψ)
4 imnan 207 . . . . . . . 8 ((φ → ¬ ψ) ↔ ¬ (φψ))
53, 4mpbir 165 . . . . . . 7 (φ → ¬ ψ)
65con2i 89 . . . . . 6 (ψ → ¬ φ)
72, 6jaoi 275 . . . . 5 ((¬ (φψ) ∨ ψ) → ¬ φ)
87con2i 89 . . . 4 (φ → ¬ (¬ (φψ) ∨ ψ))
9 eueq3.1 . . . . . 6 AV
109eueq1 1428 . . . . 5 ∃!x x = A
11 euanv 1053 . . . . . 6 (∃!x(φx = A) ↔ (φ ∧ ∃!x x = A))
1211biimpr 134 . . . . 5 ((φ ∧ ∃!x x = A) → ∃!x(φx = A))
1310, 12mpan2 519 . . . 4 (φ → ∃!x(φx = A))
141, 8, 13sylanc 361 . . 3 (φ → ∃!x((¬ (φψ) ∨ ψ) ∨ (φx = A)))
15 negb 79 . . . . . . . . 9 ((φψ) → ¬ ¬ (φψ))
1615orci 226 . . . . . . . 8 (φ → ¬ ¬ (φψ))
1716bianfd 554 . . . . . . 7 (φ → (¬ (φψ) ↔ (¬ (φψ) ∧ x = B)))
185bianfd 554 . . . . . . 7 (φ → (ψ ↔ (ψx = C)))
1917, 18orbi12d 475 . . . . . 6 (φ → ((¬ (φψ) ∨ ψ) ↔ ((¬ (φψ) ∧ x = B) ∨ (ψx = C))))
2019orbi2d 466 . . . . 5 (φ → (((φx = A) ∨ (¬ (φψ) ∨ ψ)) ↔ ((φx = A) ∨ ((¬ (φψ) ∧ x = B) ∨ (ψx = C)))))
21 orcom 209 . . . . 5 (((¬ (φψ) ∨ ψ) ∨ (φx = A)) ↔ ((φx = A) ∨ (¬ (φψ) ∨ ψ)))
22 3orass 584 . . . . 5 (((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C)) ↔ ((φx = A) ∨ ((¬ (φψ) ∧ x = B) ∨ (ψx = C))))
2320, 21, 223bitr4g 428 . . . 4 (φ → (((¬ (φψ) ∨ ψ) ∨ (φx = A)) ↔ ((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
2423bieudv 1013 . . 3 (φ → (∃!x((¬ (φψ) ∨ ψ) ∨ (φx = A)) ↔ ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
2514, 24mpbid 170 . 2 (φ → ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C)))
26 euorv 1025 . . . 4 ((¬ (φ ∨ ¬ (φψ)) ∧ ∃!x(ψx = C)) → ∃!x((φ ∨ ¬ (φψ)) ∨ (ψx = C)))
27 pm2.46 229 . . . . . 6 (¬ (φψ) → ¬ ψ)
285, 27jaoi 275 . . . . 5 ((φ ∨ ¬ (φψ)) → ¬ ψ)
2928con2i 89 . . . 4 (ψ → ¬ (φ ∨ ¬ (φψ)))
30 eueq3.3 . . . . . 6 CV
3130eueq1 1428 . . . . 5 ∃!x x = C
32 euanv 1053 . . . . . 6 (∃!x(ψx = C) ↔ (ψ ∧ ∃!x x = C))
3332biimpr 134 . . . . 5 ((ψ ∧ ∃!x x = C) → ∃!x(ψx = C))
3431, 33mpan2 519 . . . 4 (ψ → ∃!x(ψx = C))
3526, 29, 34sylanc 361 . . 3 (ψ → ∃!x((φ ∨ ¬ (φψ)) ∨ (ψx = C)))
366bianfd 554 . . . . . . 7 (ψ → (φ ↔ (φx = A)))
3715olci 227 . . . . . . . 8 (ψ → ¬ ¬ (φψ))
3837bianfd 554 . . . . . . 7 (ψ → (¬ (φψ) ↔ (¬ (φψ) ∧ x = B)))
3936, 38orbi12d 475 . . . . . 6 (ψ → ((φ ∨ ¬ (φψ)) ↔ ((φx = A) ∨ (¬ (φψ) ∧ x = B))))
4039orbi1d 467 . . . . 5 (ψ → (((φ ∨ ¬ (φψ)) ∨ (ψx = C)) ↔ (((φx = A) ∨ (¬ (φψ) ∧ x = B)) ∨ (ψx = C))))
41 df-3or 582 . . . . 5 (((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C)) ↔ (((φx = A) ∨ (¬ (φψ) ∧ x = B)) ∨ (ψx = C)))
4240, 41syl6bbr 416 . . . 4 (ψ → (((φ ∨ ¬ (φψ)) ∨ (ψx = C)) ↔ ((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
4342bieudv 1013 . . 3 (ψ → (∃!x((φ ∨ ¬ (φψ)) ∨ (ψx = C)) ↔ ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
4435, 43mpbid 170 . 2 (ψ → ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C)))
45 eueq3.2 . . . . . 6 BV
4645eueq1 1428 . . . . 5 ∃!x x = B
47 euanv 1053 . . . . . 6 (∃!x(¬ (φψ) ∧ x = B) ↔ (¬ (φψ) ∧ ∃!x x = B))
4847biimpr 134 . . . . 5 ((¬ (φψ) ∧ ∃!x x = B) → ∃!x(¬ (φψ) ∧ x = B))
4946, 48mpan2 519 . . . 4 (¬ (φψ) → ∃!x(¬ (φψ) ∧ x = B))
50 euorv 1025 . . . 4 ((¬ (φψ) ∧ ∃!x(¬ (φψ) ∧ x = B)) → ∃!x((φψ) ∨ (¬ (φψ) ∧ x = B)))
5149, 50mpdan 527 . . 3 (¬ (φψ) → ∃!x((φψ) ∨ (¬ (φψ) ∧ x = B)))
522bianfd 554 . . . . . 6 (¬ (φψ) → (φ ↔ (φx = A)))
5327bianfd 554 . . . . . . . 8 (¬ (φψ) → (ψ ↔ (ψx = C)))
5453orbi1d 467 . . . . . . 7 (¬ (φψ) → ((ψ ∨ (¬ (φψ) ∧ x = B)) ↔ ((ψx = C) ∨ (¬ (φψ) ∧ x = B))))
55 orcom 209 . . . . . . 7 (((ψx = C) ∨ (¬ (φψ) ∧ x = B)) ↔ ((¬ (φψ) ∧ x = B) ∨ (ψx = C)))
5654, 55syl6bb 414 . . . . . 6 (¬ (φψ) → ((ψ ∨ (¬ (φψ) ∧ x = B)) ↔ ((¬ (φψ) ∧ x = B) ∨ (ψx = C))))
5752, 56orbi12d 475 . . . . 5 (¬ (φψ) → ((φ ∨ (ψ ∨ (¬ (φψ) ∧ x = B))) ↔ ((φx = A) ∨ ((¬ (φψ) ∧ x = B) ∨ (ψx = C)))))
58 orass 218 . . . . 5 (((φψ) ∨ (¬ (φψ) ∧ x = B)) ↔ (φ ∨ (ψ ∨ (¬ (φψ) ∧ x = B))))
5957, 58, 223bitr4g 428 . . . 4 (¬ (φψ) → (((φψ) ∨ (¬ (φψ) ∧ x = B)) ↔ ((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
6059bieudv 1013 . . 3 (¬ (φψ) → (∃!x((φψ) ∨ (¬ (φψ) ∧ x = B)) ↔ ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))))
6151, 60mpbid 170 . 2 (¬ (φψ) → ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C)))
6225, 44, 61ecase3 559 1 ∃!x((φx = A) ∨ (¬ (φψ) ∧ x = B) ∨ (ψx = C))
Colors of variables: wff set class
Syntax hints:  ¬ wn 1   → wi 2   ∨ wo 195   ∧ wa 196   ∨ w3o 580  ∃!weu 1007   = wceq 1091   ∈ wcel 1092  Vcvv 1348
This theorem is referenced by:  moeq3 1432
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-3or 582  df-ex 679  df-sb 853  df-eu 1009  df-mo 1010  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349
metamath.org