Theorem ctssexmid 7251

Description: The decidability condition in ctssdc 7214 is needed. More specifically, ctssdc 7214 minus that condition, plus the Limited Principle of Omniscience (LPO), implies excluded middle. (Contributed by Jim Kingdon, 15-Aug-2023.)

Hypotheses

Ref	Expression
ctssexmid.1	⊢ ((𝑦 ⊆ ω ∧ ∃𝑓 𝑓:𝑦–onto→𝑥) → ∃𝑓 𝑓:ω–onto→(𝑥 ⊔ 1o))
ctssexmid.lpo	⊢ ω ∈ Omni

Assertion

Ref	Expression
ctssexmid	⊢ (𝜑 ∨ ¬ 𝜑)

Distinct variable group:   𝜑,𝑓,𝑥,𝑦

Proof of Theorem ctssexmid

Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssrab2 3277	. . 3 ⊢ {𝑧 ∈ ω ∣ 𝜑} ⊆ ω
2		f1oi 5559	. . . 4 ⊢ ( I ↾ {𝑧 ∈ ω ∣ 𝜑}):{𝑧 ∈ ω ∣ 𝜑}–1-1-onto→{𝑧 ∈ ω ∣ 𝜑}
3		f1ofo 5528	. . . 4 ⊢ (( I ↾ {𝑧 ∈ ω ∣ 𝜑}):{𝑧 ∈ ω ∣ 𝜑}–1-1-onto→{𝑧 ∈ ω ∣ 𝜑} → ( I ↾ {𝑧 ∈ ω ∣ 𝜑}):{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑})
4		ctssexmid.lpo	. . . . . . . 8 ⊢ ω ∈ Omni
5	4	elexi 2783	. . . . . . 7 ⊢ ω ∈ V
6	5	rabex 4187	. . . . . 6 ⊢ {𝑧 ∈ ω ∣ 𝜑} ∈ V
7		resiexg 5003	. . . . . 6 ⊢ ({𝑧 ∈ ω ∣ 𝜑} ∈ V → ( I ↾ {𝑧 ∈ ω ∣ 𝜑}) ∈ V)
8	6, 7	ax-mp 5	. . . . 5 ⊢ ( I ↾ {𝑧 ∈ ω ∣ 𝜑}) ∈ V
9		foeq1 5493	. . . . 5 ⊢ (𝑓 = ( I ↾ {𝑧 ∈ ω ∣ 𝜑}) → (𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑} ↔ ( I ↾ {𝑧 ∈ ω ∣ 𝜑}):{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}))
10	8, 9	spcev 2867	. . . 4 ⊢ (( I ↾ {𝑧 ∈ ω ∣ 𝜑}):{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑} → ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑})
11	2, 3, 10	mp2b 8	. . 3 ⊢ ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}
12		simpr 110	. . . . . . 7 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → 𝑦 = {𝑧 ∈ ω ∣ 𝜑})
13	12	sseq1d 3221	. . . . . 6 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (𝑦 ⊆ ω ↔ {𝑧 ∈ ω ∣ 𝜑} ⊆ ω))
14		eqidd 2205	. . . . . . . 8 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → 𝑓 = 𝑓)
15		simpl 109	. . . . . . . 8 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → 𝑥 = {𝑧 ∈ ω ∣ 𝜑})
16	14, 12, 15	foeq123d 5514	. . . . . . 7 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (𝑓:𝑦–onto→𝑥 ↔ 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}))
17	16	exbidv 1847	. . . . . 6 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (∃𝑓 𝑓:𝑦–onto→𝑥 ↔ ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}))
18	13, 17	anbi12d 473	. . . . 5 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → ((𝑦 ⊆ ω ∧ ∃𝑓 𝑓:𝑦–onto→𝑥) ↔ ({𝑧 ∈ ω ∣ 𝜑} ⊆ ω ∧ ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑})))
19		djueq1 7141	. . . . . . 7 ⊢ (𝑥 = {𝑧 ∈ ω ∣ 𝜑} → (𝑥 ⊔ 1o) = ({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o))
20		foeq3 5495	. . . . . . 7 ⊢ ((𝑥 ⊔ 1o) = ({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o) → (𝑓:ω–onto→(𝑥 ⊔ 1o) ↔ 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o)))
21	15, 19, 20	3syl 17	. . . . . 6 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (𝑓:ω–onto→(𝑥 ⊔ 1o) ↔ 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o)))
22	21	exbidv 1847	. . . . 5 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (∃𝑓 𝑓:ω–onto→(𝑥 ⊔ 1o) ↔ ∃𝑓 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o)))
23	18, 22	imbi12d 234	. . . 4 ⊢ ((𝑥 = {𝑧 ∈ ω ∣ 𝜑} ∧ 𝑦 = {𝑧 ∈ ω ∣ 𝜑}) → (((𝑦 ⊆ ω ∧ ∃𝑓 𝑓:𝑦–onto→𝑥) → ∃𝑓 𝑓:ω–onto→(𝑥 ⊔ 1o)) ↔ (({𝑧 ∈ ω ∣ 𝜑} ⊆ ω ∧ ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}) → ∃𝑓 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o))))
24		ctssexmid.1	. . . 4 ⊢ ((𝑦 ⊆ ω ∧ ∃𝑓 𝑓:𝑦–onto→𝑥) → ∃𝑓 𝑓:ω–onto→(𝑥 ⊔ 1o))
25	6, 6, 23, 24	vtocl2 2827	. . 3 ⊢ (({𝑧 ∈ ω ∣ 𝜑} ⊆ ω ∧ ∃𝑓 𝑓:{𝑧 ∈ ω ∣ 𝜑}–onto→{𝑧 ∈ ω ∣ 𝜑}) → ∃𝑓 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o))
26	1, 11, 25	mp2an 426	. 2 ⊢ ∃𝑓 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o)
27	4	a1i 9	. . . 4 ⊢ (𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o) → ω ∈ Omni)
28		id 19	. . . 4 ⊢ (𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o) → 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o))
29	27, 28	fodjuomni 7250	. . 3 ⊢ (𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o) → (∃𝑤 𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} ∨ {𝑧 ∈ ω ∣ 𝜑} = ∅))
30	29	exlimiv 1620	. 2 ⊢ (∃𝑓 𝑓:ω–onto→({𝑧 ∈ ω ∣ 𝜑} ⊔ 1o) → (∃𝑤 𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} ∨ {𝑧 ∈ ω ∣ 𝜑} = ∅))
31		biidd 172	. . . . . 6 ⊢ (𝑧 = 𝑤 → (𝜑 ↔ 𝜑))
32	31	elrab 2928	. . . . 5 ⊢ (𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} ↔ (𝑤 ∈ ω ∧ 𝜑))
33	32	simprbi 275	. . . 4 ⊢ (𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} → 𝜑)
34	33	exlimiv 1620	. . 3 ⊢ (∃𝑤 𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} → 𝜑)
35		rabeq0 3489	. . . 4 ⊢ ({𝑧 ∈ ω ∣ 𝜑} = ∅ ↔ ∀𝑧 ∈ ω ¬ 𝜑)
36		peano1 4641	. . . . 5 ⊢ ∅ ∈ ω
37		elex2 2787	. . . . 5 ⊢ (∅ ∈ ω → ∃𝑢 𝑢 ∈ ω)
38		r19.3rmv 3550	. . . . 5 ⊢ (∃𝑢 𝑢 ∈ ω → (¬ 𝜑 ↔ ∀𝑧 ∈ ω ¬ 𝜑))
39	36, 37, 38	mp2b 8	. . . 4 ⊢ (¬ 𝜑 ↔ ∀𝑧 ∈ ω ¬ 𝜑)
40	35, 39	sylbb2 138	. . 3 ⊢ ({𝑧 ∈ ω ∣ 𝜑} = ∅ → ¬ 𝜑)
41	34, 40	orim12i 760	. 2 ⊢ ((∃𝑤 𝑤 ∈ {𝑧 ∈ ω ∣ 𝜑} ∨ {𝑧 ∈ ω ∣ 𝜑} = ∅) → (𝜑 ∨ ¬ 𝜑))
42	26, 30, 41	mp2b 8	1 ⊢ (𝜑 ∨ ¬ 𝜑)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 709   = wceq 1372  ∃wex 1514   ∈ wcel 2175  ∀wral 2483  {crab 2487  Vcvv 2771   ⊆ wss 3165  ∅c0 3459   I cid 4334  ωcom 4637   ↾ cres 4676  –onto→wfo 5268  –1-1-onto→wf1o 5269  1_oc1o 6494   ⊔ cdju 7138  Omnicomni 7235

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1469  ax-7 1470  ax-gen 1471  ax-ie1 1515  ax-ie2 1516  ax-8 1526  ax-10 1527  ax-11 1528  ax-i12 1529  ax-bndl 1531  ax-4 1532  ax-17 1548  ax-i9 1552  ax-ial 1556  ax-i5r 1557  ax-13 2177  ax-14 2178  ax-ext 2186  ax-sep 4161  ax-nul 4169  ax-pow 4217  ax-pr 4252  ax-un 4479  ax-setind 4584

This theorem depends on definitions:  df-bi 117  df-dc 836  df-3an 982  df-tru 1375  df-fal 1378  df-nf 1483  df-sb 1785  df-eu 2056  df-mo 2057  df-clab 2191  df-cleq 2197  df-clel 2200  df-nfc 2336  df-ne 2376  df-ral 2488  df-rex 2489  df-rab 2492  df-v 2773  df-sbc 2998  df-csb 3093  df-dif 3167  df-un 3169  df-in 3171  df-ss 3178  df-nul 3460  df-if 3571  df-pw 3617  df-sn 3638  df-pr 3639  df-op 3641  df-uni 3850  df-int 3885  df-br 4044  df-opab 4105  df-mpt 4106  df-tr 4142  df-id 4339  df-iord 4412  df-on 4414  df-suc 4417  df-iom 4638  df-xp 4680  df-rel 4681  df-cnv 4682  df-co 4683  df-dm 4684  df-rn 4685  df-res 4686  df-ima 4687  df-iota 5231  df-fun 5272  df-fn 5273  df-f 5274  df-f1 5275  df-fo 5276  df-f1o 5277  df-fv 5278  df-ov 5946  df-oprab 5947  df-mpo 5948  df-1st 6225  df-2nd 6226  df-1o 6501  df-2o 6502  df-map 6736  df-dju 7139  df-inl 7148  df-inr 7149  df-omni 7236

This theorem is referenced by: (None)