Theorem modom 7108

Description: Two ways to express "at most one". (Contributed by Stefan O'Rear, 28-Oct-2014.)

Assertion

Ref	Expression
modom	⊢ (∃*𝑥𝜑 ↔ {𝑥 ∣ 𝜑} ≼ 1o)

Proof of Theorem modom

Dummy variables 𝑢 𝑣 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1oex 6695	. . 3 ⊢ 1o ∈ V
2		0lt1o 6713	. . . . 5 ⊢ ∅ ∈ 1o
3	2	2a1i 27	. . . 4 ⊢ (∃*𝑥𝜑 → (𝑢 ∈ {𝑥 ∣ 𝜑} → ∅ ∈ 1o))
4		eqidd 2239	. . . . . 6 ⊢ ((∃*𝑥𝜑 ∧ (𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑})) → ∅ = ∅)
5		df-clab 2225	. . . . . . . . 9 ⊢ (𝑢 ∈ {𝑥 ∣ 𝜑} ↔ [𝑢 / 𝑥]𝜑)
6		df-clab 2225	. . . . . . . . 9 ⊢ (𝑣 ∈ {𝑥 ∣ 𝜑} ↔ [𝑣 / 𝑥]𝜑)
7	5, 6	anbi12i 464	. . . . . . . 8 ⊢ ((𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑}) ↔ ([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑))
8		nfv 1581	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝜑
9	8	mo3 2141	. . . . . . . . . 10 ⊢ (∃*𝑥𝜑 ↔ ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
10		nfcv 2392	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥𝑢
11		nfs1v 1999	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥[𝑢 / 𝑥]𝜑
12		nfs1v 1999	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑥[𝑦 / 𝑥]𝜑
13	11, 12	nfan 1618	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑)
14		nfv 1581	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑥 𝑢 = 𝑦
15	13, 14	nfim 1625	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑥(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦)
16	15	nfal 1629	. . . . . . . . . . . 12 ⊢ Ⅎ𝑥∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦)
17		sbequ12 1824	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑢 → (𝜑 ↔ [𝑢 / 𝑥]𝜑))
18	17	anbi1d 469	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑢 → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) ↔ ([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑)))
19		equequ1 1764	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑢 → (𝑥 = 𝑦 ↔ 𝑢 = 𝑦))
20	18, 19	imbi12d 234	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑢 → (((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ (([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦)))
21	20	albidv 1877	. . . . . . . . . . . 12 ⊢ (𝑥 = 𝑢 → (∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) ↔ ∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦)))
22	10, 16, 21	spcgf 2907	. . . . . . . . . . 11 ⊢ (𝑢 ∈ V → (∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦)))
23	22	elv 2825	. . . . . . . . . 10 ⊢ (∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦) → ∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦))
24	9, 23	sylbi 121	. . . . . . . . 9 ⊢ (∃*𝑥𝜑 → ∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦))
25		nfcv 2392	. . . . . . . . . . 11 ⊢ Ⅎ𝑦𝑣
26		nfv 1581	. . . . . . . . . . 11 ⊢ Ⅎ𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑) → 𝑢 = 𝑣)
27		sbequ 1893	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑣 → ([𝑦 / 𝑥]𝜑 ↔ [𝑣 / 𝑥]𝜑))
28	27	anbi2d 468	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑣 → (([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) ↔ ([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑)))
29		equequ2 1765	. . . . . . . . . . . 12 ⊢ (𝑦 = 𝑣 → (𝑢 = 𝑦 ↔ 𝑢 = 𝑣))
30	28, 29	imbi12d 234	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑣 → ((([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦) ↔ (([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑) → 𝑢 = 𝑣)))
31	25, 26, 30	spcgf 2907	. . . . . . . . . 10 ⊢ (𝑣 ∈ V → (∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦) → (([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑) → 𝑢 = 𝑣)))
32	31	elv 2825	. . . . . . . . 9 ⊢ (∀𝑦(([𝑢 / 𝑥]𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑢 = 𝑦) → (([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑) → 𝑢 = 𝑣))
33	24, 32	syl 14	. . . . . . . 8 ⊢ (∃*𝑥𝜑 → (([𝑢 / 𝑥]𝜑 ∧ [𝑣 / 𝑥]𝜑) → 𝑢 = 𝑣))
34	7, 33	biimtrid 152	. . . . . . 7 ⊢ (∃*𝑥𝜑 → ((𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑}) → 𝑢 = 𝑣))
35	34	imp 124	. . . . . 6 ⊢ ((∃*𝑥𝜑 ∧ (𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑})) → 𝑢 = 𝑣)
36	4, 35	2thd 175	. . . . 5 ⊢ ((∃*𝑥𝜑 ∧ (𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑})) → (∅ = ∅ ↔ 𝑢 = 𝑣))
37	36	ex 115	. . . 4 ⊢ (∃*𝑥𝜑 → ((𝑢 ∈ {𝑥 ∣ 𝜑} ∧ 𝑣 ∈ {𝑥 ∣ 𝜑}) → (∅ = ∅ ↔ 𝑢 = 𝑣)))
38	3, 37	dom2d 7059	. . 3 ⊢ (∃*𝑥𝜑 → (1o ∈ V → {𝑥 ∣ 𝜑} ≼ 1o))
39	1, 38	mpi 15	. 2 ⊢ (∃*𝑥𝜑 → {𝑥 ∣ 𝜑} ≼ 1o)
40		nfab1 2394	. . . . 5 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑}
41		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥 ≼
42		nfcv 2392	. . . . 5 ⊢ Ⅎ𝑥1o
43	40, 41, 42	nfbr 4177	. . . 4 ⊢ Ⅎ𝑥{𝑥 ∣ 𝜑} ≼ 1o
44		simpl 109	. . . . . . 7 ⊢ (({𝑥 ∣ 𝜑} ≼ 1o ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → {𝑥 ∣ 𝜑} ≼ 1o)
45		abid 2226	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑥 ∣ 𝜑} ↔ 𝜑)
46	45	biimpri 133	. . . . . . . 8 ⊢ (𝜑 → 𝑥 ∈ {𝑥 ∣ 𝜑})
47	46	ad2antrl 494	. . . . . . 7 ⊢ (({𝑥 ∣ 𝜑} ≼ 1o ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 ∈ {𝑥 ∣ 𝜑})
48		df-clab 2225	. . . . . . . . 9 ⊢ (𝑦 ∈ {𝑥 ∣ 𝜑} ↔ [𝑦 / 𝑥]𝜑)
49	48	biimpri 133	. . . . . . . 8 ⊢ ([𝑦 / 𝑥]𝜑 → 𝑦 ∈ {𝑥 ∣ 𝜑})
50	49	ad2antll 495	. . . . . . 7 ⊢ (({𝑥 ∣ 𝜑} ≼ 1o ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑦 ∈ {𝑥 ∣ 𝜑})
51		1dom1el 7107	. . . . . . 7 ⊢ (({𝑥 ∣ 𝜑} ≼ 1o ∧ 𝑥 ∈ {𝑥 ∣ 𝜑} ∧ 𝑦 ∈ {𝑥 ∣ 𝜑}) → 𝑥 = 𝑦)
52	44, 47, 50, 51	syl3anc 1278	. . . . . 6 ⊢ (({𝑥 ∣ 𝜑} ≼ 1o ∧ (𝜑 ∧ [𝑦 / 𝑥]𝜑)) → 𝑥 = 𝑦)
53	52	ex 115	. . . . 5 ⊢ ({𝑥 ∣ 𝜑} ≼ 1o → ((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
54	53	alrimiv 1927	. . . 4 ⊢ ({𝑥 ∣ 𝜑} ≼ 1o → ∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
55	43, 54	alrimi 1575	. . 3 ⊢ ({𝑥 ∣ 𝜑} ≼ 1o → ∀𝑥∀𝑦((𝜑 ∧ [𝑦 / 𝑥]𝜑) → 𝑥 = 𝑦))
56	55, 9	sylibr 134	. 2 ⊢ ({𝑥 ∣ 𝜑} ≼ 1o → ∃*𝑥𝜑)
57	39, 56	impbii 126	1 ⊢ (∃*𝑥𝜑 ↔ {𝑥 ∣ 𝜑} ≼ 1o)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∀wal 1400   = wceq 1402  [wsb 1815  ∃*wmo 2087   ∈ wcel 2209  {cab 2224  Vcvv 2821  ∅c0 3520   class class class wbr 4130  1_oc1o 6680   ≼ cdom 7021

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1o 6687  df-dom 7024

This theorem is used by:  modom2  7109