Theorem mosubopt 5393

Description: "At most one" remains true inside ordered pair quantification. (Contributed by NM, 28-Aug-2007.)

Assertion

Ref	Expression
mosubopt	⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))

Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem mosubopt

Step	Hyp	Ref	Expression
1		nfa1 2154	. . 3 ⊢ Ⅎ𝑦∀𝑦∀𝑧∃*𝑥𝜑
2		nfe1 2153	. . . 4 ⊢ Ⅎ𝑦∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
3	2	nfmov 2643	. . 3 ⊢ Ⅎ𝑦∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
4		nfa1 2154	. . . . 5 ⊢ Ⅎ𝑧∀𝑧∃*𝑥𝜑
5		nfe1 2153	. . . . . . 7 ⊢ Ⅎ𝑧∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
6	5	nfex 2342	. . . . . 6 ⊢ Ⅎ𝑧∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
7	6	nfmov 2643	. . . . 5 ⊢ Ⅎ𝑧∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
8		copsexgw 5374	. . . . . . . 8 ⊢ (𝐴 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ ∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
9	8	mobidv 2632	. . . . . . 7 ⊢ (𝐴 = ⟨𝑦, 𝑧⟩ → (∃*𝑥𝜑 ↔ ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
10	9	biimpcd 251	. . . . . 6 ⊢ (∃*𝑥𝜑 → (𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
11	10	sps 2183	. . . . 5 ⊢ (∀𝑧∃*𝑥𝜑 → (𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
12	4, 7, 11	exlimd 2217	. . . 4 ⊢ (∀𝑧∃*𝑥𝜑 → (∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
13	12	sps 2183	. . 3 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → (∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
14	1, 3, 13	exlimd 2217	. 2 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → (∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
15		simpl 485	. . . . . 6 ⊢ ((𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → 𝐴 = ⟨𝑦, 𝑧⟩)
16	15	2eximi 1835	. . . . 5 ⊢ (∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩)
17	16	exlimiv 1930	. . . 4 ⊢ (∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩)
18	17	con3i 157	. . 3 ⊢ (¬ ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ¬ ∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
19		nexmo 2622	. . 3 ⊢ (¬ ∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
20	18, 19	syl 17	. 2 ⊢ (¬ ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
21	14, 20	pm2.61d1 182	1 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398  ∀wal 1534   = wceq 1536  ∃wex 1779  ∃*wmo 2619  ⟨cop 4566

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-rab 3146  df-v 3493  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567

This theorem is referenced by:  mosubop  5394  funoprabg  7266