Theorem fsetprcnexALT 47953

Description: First version of proof for fsetprcnex 8866, which was much more complicated. (Contributed by AV, 14-Sep-2024.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
fsetprcnexALT	⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)

Distinct variable groups:   𝐴,𝑓   𝐵,𝑓

Allowed substitution hint:   𝑉(𝑓)

Proof of Theorem fsetprcnexALT

Dummy variables 𝑎 𝑏 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		abanssl 4257	. 2 ⊢ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ⊆ {𝑓 ∣ 𝑓:𝐴⟶𝐵}
2		n0 4300	. . . . . 6 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑦 𝑦 ∈ 𝐴)
3		vex 3454	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
4	3	a1i 11	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) → 𝑦 ∈ V)
5		fsetsnprcnex 47946	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ V ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∉ V)
6	4, 5	sylan 592	. . . . . . . . . 10 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∉ V)
7		df-nel 3062	. . . . . . . . . 10 ⊢ ({𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∉ V ↔ ¬ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∈ V)
8	6, 7	sylib 221	. . . . . . . . 9 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∉ V) → ¬ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∈ V)
9		eqid 2760	. . . . . . . . . . . . 13 ⊢ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} = {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)}
10		eqid 2760	. . . . . . . . . . . . 13 ⊢ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} = {𝑓 ∣ 𝑓:{𝑦}⟶𝐵}
11		eqid 2760	. . . . . . . . . . . . 13 ⊢ (𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))) = (𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦)))
12	9, 10, 11	cfsetsnfsetf1o 47952	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑦 ∈ 𝐴) → (𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))):{𝑓 ∣ 𝑓:{𝑦}⟶𝐵}–1-1-onto→{𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)})
13	12	ancoms 464	. . . . . . . . . . 11 ⊢ ((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))):{𝑓 ∣ 𝑓:{𝑦}⟶𝐵}–1-1-onto→{𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)})
14	13	adantr 486	. . . . . . . . . 10 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∉ V) → (𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))):{𝑓 ∣ 𝑓:{𝑦}⟶𝐵}–1-1-onto→{𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)})
15		f1ovv 7956	. . . . . . . . . . 11 ⊢ ((𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))):{𝑓 ∣ 𝑓:{𝑦}⟶𝐵}–1-1-onto→{𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} → ({𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∈ V ↔ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V))
16	15	bicomd 226	. . . . . . . . . 10 ⊢ ((𝑔 ∈ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ↦ (𝑎 ∈ 𝐴 ↦ (𝑔‘𝑦))):{𝑓 ∣ 𝑓:{𝑦}⟶𝐵}–1-1-onto→{𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} → ({𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V ↔ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∈ V))
17	14, 16	syl 18	. . . . . . . . 9 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∉ V) → ({𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V ↔ {𝑓 ∣ 𝑓:{𝑦}⟶𝐵} ∈ V))
18	8, 17	mtbird 328	. . . . . . . 8 ⊢ (((𝑦 ∈ 𝐴 ∧ 𝐴 ∈ 𝑉) ∧ 𝐵 ∉ V) → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)
19	18	exp31 425	. . . . . . 7 ⊢ (𝑦 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)))
20	19	exlimiv 1963	. . . . . 6 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)))
21	2, 20	sylbi 220	. . . . 5 ⊢ (𝐴 ≠ ∅ → (𝐴 ∈ 𝑉 → (𝐵 ∉ V → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)))
22	21	impcom 413	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) → (𝐵 ∉ V → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V))
23	22	imp 412	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)
24		df-nel 3062	. . 3 ⊢ ({𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∉ V ↔ ¬ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∈ V)
25	23, 24	sylibr 237	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∉ V)
26		prcssprc 5292	. 2 ⊢ (({𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ⊆ {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∧ {𝑓 ∣ (𝑓:𝐴⟶𝐵 ∧ ∃𝑏 ∈ 𝐵 ∀𝑧 ∈ 𝐴 (𝑓‘𝑧) = 𝑏)} ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)
27	1, 25, 26	sylancr 599	1 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐴 ≠ ∅) ∧ 𝐵 ∉ V) → {𝑓 ∣ 𝑓:𝐴⟶𝐵} ∉ V)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  {cab 2738   ≠ wne 2955   ∉ wnel 3061  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3899  ∅c0 4279  {csn 4584   ↦ cmpt 5186  ⟶wf 6529  –1-1-onto→wf1o 6532  ‘cfv 6533

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pr 5398  ax-un 7737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541

This theorem is used by: (None)