Theorem mosubopt 5402

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 2155	. . 3 ⊢ Ⅎ𝑦∀𝑦∀𝑧∃*𝑥𝜑
2		nfe1 2154	. . . 4 ⊢ Ⅎ𝑦∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
3	2	nfmov 2644	. . 3 ⊢ Ⅎ𝑦∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
4		nfa1 2155	. . . . 5 ⊢ Ⅎ𝑧∀𝑧∃*𝑥𝜑
5		nfe1 2154	. . . . . . 7 ⊢ Ⅎ𝑧∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
6	5	nfex 2343	. . . . . 6 ⊢ Ⅎ𝑧∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
7	6	nfmov 2644	. . . . 5 ⊢ Ⅎ𝑧∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
8		copsexgw 5383	. . . . . . . 8 ⊢ (𝐴 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ ∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
9	8	mobidv 2633	. . . . . . 7 ⊢ (𝐴 = ⟨𝑦, 𝑧⟩ → (∃*𝑥𝜑 ↔ ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
10	9	biimpcd 251	. . . . . 6 ⊢ (∃*𝑥𝜑 → (𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
11	10	sps 2184	. . . . 5 ⊢ (∀𝑧∃*𝑥𝜑 → (𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
12	4, 7, 11	exlimd 2218	. . . 4 ⊢ (∀𝑧∃*𝑥𝜑 → (∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
13	12	sps 2184	. . 3 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → (∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
14	1, 3, 13	exlimd 2218	. 2 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → (∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)))
15		simpl 485	. . . . . 6 ⊢ ((𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → 𝐴 = ⟨𝑦, 𝑧⟩)
16	15	2eximi 1836	. . . . 5 ⊢ (∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩)
17	16	exlimiv 1931	. . . 4 ⊢ (∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩)
18	17	con3i 157	. . 3 ⊢ (¬ ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ¬ ∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
19		nexmo 2623	. . 3 ⊢ (¬ ∃𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑) → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
20	18, 19	syl 17	. 2 ⊢ (¬ ∃𝑦∃𝑧 𝐴 = ⟨𝑦, 𝑧⟩ → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
21	14, 20	pm2.61d1 182	1 ⊢ (∀𝑦∀𝑧∃*𝑥𝜑 → ∃*𝑥∃𝑦∃𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 398  ∀wal 1535   = wceq 1537  ∃wex 1780  ∃*wmo 2620  ⟨cop 4575

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576

This theorem is referenced by:  mosubop  5403  funoprabg  7275