hashf1lem1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > hashf1lem1		Structured version Visualization version GIF version

Theorem hashf1lem1 14488

Description: Lemma for hashf1 14490. (Contributed by Mario Carneiro, 17-Apr-2015.) (Proof shortened by AV, 14-Aug-2024.)

**Hypotheses**
Ref	Expression
hashf1lem2.1	⊢ (𝜑 → 𝐴 ∈ Fin)
hashf1lem2.2	⊢ (𝜑 → 𝐵 ∈ Fin)
hashf1lem2.3	⊢ (𝜑 → ¬ 𝑧 ∈ 𝐴)
hashf1lem2.4	⊢ (𝜑 → ((♯‘𝐴) + 1) ≤ (♯‘𝐵))
hashf1lem1.5	⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)

**Assertion**
Ref	Expression
hashf1lem1	⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ≈ (𝐵 ∖ ran 𝐹))

Distinct variable groups: 𝑧,𝑓 𝐴,𝑓 𝐵,𝑓 𝜑,𝑓 𝑓,𝐹 Allowed substitution hints: 𝜑(𝑧) 𝐴(𝑧) 𝐵(𝑧) 𝐹(𝑧)

Proof of Theorem hashf1lem1 Dummy variables 𝑔 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		hashf1lem2.2	. . . 4 ⊢ (𝜑 → 𝐵 ∈ Fin)
2		f1setex 8850	. . . 4 ⊢ (𝐵 ∈ Fin → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
3	1, 2	syl 18	. . 3 ⊢ (𝜑 → {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵} ∈ V)
4		abanssr 4265	. . . 4 ⊢ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵}
5	4	a1i 11	. . 3 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ⊆ {𝑓 ∣ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵})
6	3, 5	ssexd 5295	. 2 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∈ V)
7	1	difexd 5302	. 2 ⊢ (𝜑 → (𝐵 ∖ ran 𝐹) ∈ V)
8		vex 3459	. . . 4 ⊢ 𝑔 ∈ V
9		reseq1 5972	. . . . . 6 ⊢ (𝑓 = 𝑔 → (𝑓 ↾ 𝐴) = (𝑔 ↾ 𝐴))
10	9	eqeq1d 2765	. . . . 5 ⊢ (𝑓 = 𝑔 → ((𝑓 ↾ 𝐴) = 𝐹 ↔ (𝑔 ↾ 𝐴) = 𝐹))
11		f1eq1 6769	. . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
12	10, 11	anbi12d 643	. . . 4 ⊢ (𝑓 = 𝑔 → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)))
13	8, 12	elab 3638	. . 3 ⊢ (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵))
14		f1f 6774	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
15	14	ad2antll 741	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})⟶𝐵)
16		ssun2 4132	. . . . . . 7 ⊢ {𝑧} ⊆ (𝐴 ∪ {𝑧})
17		vex 3459	. . . . . . . 8 ⊢ 𝑧 ∈ V
18	17	snss 4750	. . . . . . 7 ⊢ (𝑧 ∈ (𝐴 ∪ {𝑧}) ↔ {𝑧} ⊆ (𝐴 ∪ {𝑧}))
19	16, 18	mpbir 234	. . . . . 6 ⊢ 𝑧 ∈ (𝐴 ∪ {𝑧})
20		ffvelcdm 7076	. . . . . 6 ⊢ ((𝑔:(𝐴 ∪ {𝑧})⟶𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧})) → (𝑔‘𝑧) ∈ 𝐵)
21	15, 19, 20	sylancl 597	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ 𝐵)
22		hashf1lem2.3	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑧 ∈ 𝐴)
23	22	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ 𝑧 ∈ 𝐴)
24		df-ima 5674	. . . . . . . . 9 ⊢ (𝑔 “ 𝐴) = ran (𝑔 ↾ 𝐴)
25		simprl 782	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 ↾ 𝐴) = 𝐹)
26	25	rneqd 5928	. . . . . . . . 9 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ran (𝑔 ↾ 𝐴) = ran 𝐹)
27	24, 26	eqtrid 2810	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔 “ 𝐴) = ran 𝐹)
28	27	eleq2d 2849	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ (𝑔‘𝑧) ∈ ran 𝐹))
29		simprr 784	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
30	19	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝑧 ∈ (𝐴 ∪ {𝑧}))
31		ssun1 4131	. . . . . . . . 9 ⊢ 𝐴 ⊆ (𝐴 ∪ {𝑧})
32	31	a1i 11	. . . . . . . 8 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → 𝐴 ⊆ (𝐴 ∪ {𝑧}))
33		f1elima 7261	. . . . . . . 8 ⊢ ((𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 ∧ 𝑧 ∈ (𝐴 ∪ {𝑧}) ∧ 𝐴 ⊆ (𝐴 ∪ {𝑧})) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
34	29, 30, 32, 33	syl3anc 1398	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ (𝑔 “ 𝐴) ↔ 𝑧 ∈ 𝐴))
35	28, 34	bitr3d 284	. . . . . 6 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ((𝑔‘𝑧) ∈ ran 𝐹 ↔ 𝑧 ∈ 𝐴))
36	23, 35	mtbird 328	. . . . 5 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → ¬ (𝑔‘𝑧) ∈ ran 𝐹)
37	21, 36	eldifd 3916	. . . 4 ⊢ ((𝜑 ∧ ((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹))
38	37	ex 417	. . 3 ⊢ (𝜑 → (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
39	13, 38	biimtrid 245	. 2 ⊢ (𝜑 → (𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} → (𝑔‘𝑧) ∈ (𝐵 ∖ ran 𝐹)))
40		hashf1lem1.5	. . . . . . 7 ⊢ (𝜑 → 𝐹:𝐴–1-1→𝐵)
41		f1f 6774	. . . . . . 7 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
42	40, 41	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵)
43	42	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴⟶𝐵)
44		vex 3459	. . . . . . . 8 ⊢ 𝑥 ∈ V
45	17, 44	f1osn 6862	. . . . . . 7 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}
46		f1of 6820	. . . . . . 7 ⊢ ({⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥} → {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥})
47	45, 46	ax-mp 5	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥}
48		eldifi 4085	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → 𝑥 ∈ 𝐵)
49	48	adantl 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝑥 ∈ 𝐵)
50	49	snssd 4752	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {𝑥} ⊆ 𝐵)
51		fss 6722	. . . . . 6 ⊢ (({⟨𝑧, 𝑥⟩}:{𝑧}⟶{𝑥} ∧ {𝑥} ⊆ 𝐵) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
52	47, 50, 51	sylancr 598	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵)
53		res0 5982	. . . . . . 7 ⊢ (𝐹 ↾ ∅) = ∅
54		res0 5982	. . . . . . 7 ⊢ ({⟨𝑧, 𝑥⟩} ↾ ∅) = ∅
55	53, 54	eqtr4i 2789	. . . . . 6 ⊢ (𝐹 ↾ ∅) = ({⟨𝑧, 𝑥⟩} ↾ ∅)
56		disjsn 4677	. . . . . . . . 9 ⊢ ((𝐴 ∩ {𝑧}) = ∅ ↔ ¬ 𝑧 ∈ 𝐴)
57	22, 56	sylibr 237	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∩ {𝑧}) = ∅)
58	57	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐴 ∩ {𝑧}) = ∅)
59	58	reseq2d 5978	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ↾ (𝐴 ∩ {𝑧})) = (𝐹 ↾ ∅))
60	58	reseq2d 5978	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ ∅))
61	55, 59, 60	3eqtr4a 2824	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧})))
62		fresaunres1 6751	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}⟶𝐵 ∧ (𝐹 ↾ (𝐴 ∩ {𝑧})) = ({⟨𝑧, 𝑥⟩} ↾ (𝐴 ∩ {𝑧}))) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
63	43, 52, 61, 62	syl3anc 1398	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹)
64		f1f1orn 6832	. . . . . . . . 9 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
65	40, 64	syl 18	. . . . . . . 8 ⊢ (𝜑 → 𝐹:𝐴–1-1-onto→ran 𝐹)
66	65	adantr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹:𝐴–1-1-onto→ran 𝐹)
67	45	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥})
68		eldifn 4086	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝐵 ∖ ran 𝐹) → ¬ 𝑥 ∈ ran 𝐹)
69	68	adantl 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ¬ 𝑥 ∈ ran 𝐹)
70		disjsn 4677	. . . . . . . 8 ⊢ ((ran 𝐹 ∩ {𝑥}) = ∅ ↔ ¬ 𝑥 ∈ ran 𝐹)
71	69, 70	sylibr 237	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∩ {𝑥}) = ∅)
72		f1oun 6840	. . . . . . 7 ⊢ (((𝐹:𝐴–1-1-onto→ran 𝐹 ∧ {⟨𝑧, 𝑥⟩}:{𝑧}–1-1-onto→{𝑥}) ∧ ((𝐴 ∩ {𝑧}) = ∅ ∧ (ran 𝐹 ∩ {𝑥}) = ∅)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
73	66, 67, 58, 71, 72	syl22anc 851	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
74		f1of1 6819	. . . . . 6 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
75	73, 74	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}))
76	43	frnd 6714	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ran 𝐹 ⊆ 𝐵)
77	76, 50	unssd 4145	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵)
78		f1ss 6781	. . . . 5 ⊢ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→(ran 𝐹 ∪ {𝑥}) ∧ (ran 𝐹 ∪ {𝑥}) ⊆ 𝐵) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
79	75, 77, 78	syl2anc 595	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)
80		hashf1lem2.1	. . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ Fin)
81	42, 80	fexd 7225	. . . . . . 7 ⊢ (𝜑 → 𝐹 ∈ V)
82	81	adantr 485	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → 𝐹 ∈ V)
83		snex 5410	. . . . . 6 ⊢ {⟨𝑧, 𝑥⟩} ∈ V
84		unexg 7741	. . . . . 6 ⊢ ((𝐹 ∈ V ∧ {⟨𝑧, 𝑥⟩} ∈ V) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
85	82, 83, 84	sylancl 597	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V)
86		reseq1 5972	. . . . . . . 8 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓 ↾ 𝐴) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴))
87	86	eqeq1d 2765	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → ((𝑓 ↾ 𝐴) = 𝐹 ↔ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹))
88		f1eq1 6769	. . . . . . 7 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵 ↔ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵))
89	87, 88	anbi12d 643	. . . . . 6 ⊢ (𝑓 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) → (((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵) ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
90	89	elabg 3635	. . . . 5 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ V → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
91	85, 90	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ↔ (((𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↾ 𝐴) = 𝐹 ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1→𝐵)))
92	63, 79, 91	mpbir2and 725	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)})
93	92	ex 417	. 2 ⊢ (𝜑 → (𝑥 ∈ (𝐵 ∖ ran 𝐹) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)}))
94	13	anbi1i 635	. . 3 ⊢ ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) ↔ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)))
95		simprlr 791	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵)
96		f1fn 6775	. . . . . . 7 ⊢ (𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵 → 𝑔 Fn (𝐴 ∪ {𝑧}))
97	95, 96	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → 𝑔 Fn (𝐴 ∪ {𝑧}))
98	73	adantrl 728	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}))
99		f1ofn 6821	. . . . . . 7 ⊢ ((𝐹 ∪ {⟨𝑧, 𝑥⟩}):(𝐴 ∪ {𝑧})–1-1-onto→(ran 𝐹 ∪ {𝑥}) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
100	98, 99	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧}))
101		eqfnfv 7025	. . . . . 6 ⊢ ((𝑔 Fn (𝐴 ∪ {𝑧}) ∧ (𝐹 ∪ {⟨𝑧, 𝑥⟩}) Fn (𝐴 ∪ {𝑧})) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
102	97, 100, 101	syl2anc 595	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
103		fvres 6900	. . . . . . . . . . 11 ⊢ (𝑦 ∈ 𝐴 → ((𝑔 ↾ 𝐴)‘𝑦) = (𝑔‘𝑦))
104	103	eqcomd 2769	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝐴 → (𝑔‘𝑦) = ((𝑔 ↾ 𝐴)‘𝑦))
105		simprll 790	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 ↾ 𝐴) = 𝐹)
106	105	fveq1d 6883	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔 ↾ 𝐴)‘𝑦) = (𝐹‘𝑦))
107	104, 106	sylan9eqr 2820	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = (𝐹‘𝑦))
108	40	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹:𝐴–1-1→𝐵)
109		f1fn 6775	. . . . . . . . . . 11 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹 Fn 𝐴)
110	108, 109	syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝐹 Fn 𝐴)
111	17, 44	fnsn 6594	. . . . . . . . . . 11 ⊢ {⟨𝑧, 𝑥⟩} Fn {𝑧}
112	111	a1i 11	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → {⟨𝑧, 𝑥⟩} Fn {𝑧})
113	57	ad2antrr 738	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝐴 ∩ {𝑧}) = ∅)
114		simpr 489	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
115	110, 112, 113, 114	fvun1d 6974	. . . . . . . . 9 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = (𝐹‘𝑦))
116	107, 115	eqtr4d 2801	. . . . . . . 8 ⊢ (((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) ∧ 𝑦 ∈ 𝐴) → (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
117	116	ralrimiva 3157	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))
118	117	biantrurd 541	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦))))
119		ralunb 4150	. . . . . 6 ⊢ (∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (∀𝑦 ∈ 𝐴 (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ∧ ∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
120	118, 119	bitr4di 292	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ ∀𝑦 ∈ (𝐴 ∪ {𝑧})(𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦)))
121	42	fdmd 6716	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = 𝐴)
122	121	eleq2d 2849	. . . . . . . . . 10 ⊢ (𝜑 → (𝑧 ∈ dom 𝐹 ↔ 𝑧 ∈ 𝐴))
123	22, 122	mtbird 328	. . . . . . . . 9 ⊢ (𝜑 → ¬ 𝑧 ∈ dom 𝐹)
124	123	adantr 485	. . . . . . . 8 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ¬ 𝑧 ∈ dom 𝐹)
125		fsnunfv 7185	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ 𝑥 ∈ V ∧ ¬ 𝑧 ∈ dom 𝐹) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
126	17, 44, 124, 125	mp3an12i 1494	. . . . . . 7 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) = 𝑥)
127	126	eqeq2d 2774	. . . . . 6 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → ((𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧) ↔ (𝑔‘𝑧) = 𝑥))
128		fveq2 6881	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → (𝑔‘𝑦) = (𝑔‘𝑧))
129		fveq2 6881	. . . . . . . 8 ⊢ (𝑦 = 𝑧 → ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
130	128, 129	eqeq12d 2779	. . . . . . 7 ⊢ (𝑦 = 𝑧 → ((𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧)))
131	17, 130	ralsn 4647	. . . . . 6 ⊢ (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ (𝑔‘𝑧) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑧))
132		eqcom 2770	. . . . . 6 ⊢ (𝑥 = (𝑔‘𝑧) ↔ (𝑔‘𝑧) = 𝑥)
133	127, 131, 132	3bitr4g 317	. . . . 5 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (∀𝑦 ∈ {𝑧} (𝑔‘𝑦) = ((𝐹 ∪ {⟨𝑧, 𝑥⟩})‘𝑦) ↔ 𝑥 = (𝑔‘𝑧)))
134	102, 120, 133	3bitr2d 310	. . . 4 ⊢ ((𝜑 ∧ (((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹))) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧)))
135	134	ex 417	. . 3 ⊢ (𝜑 → ((((𝑔 ↾ 𝐴) = 𝐹 ∧ 𝑔:(𝐴 ∪ {𝑧})–1-1→𝐵) ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
136	94, 135	biimtrid 245	. 2 ⊢ (𝜑 → ((𝑔 ∈ {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ∧ 𝑥 ∈ (𝐵 ∖ ran 𝐹)) → (𝑔 = (𝐹 ∪ {⟨𝑧, 𝑥⟩}) ↔ 𝑥 = (𝑔‘𝑧))))
137	6, 7, 39, 93, 136	en3d 8982	1 ⊢ (𝜑 → {𝑓 ∣ ((𝑓 ↾ 𝐴) = 𝐹 ∧ 𝑓:(𝐴 ∪ {𝑧})–1-1→𝐵)} ≈ (𝐵 ∖ ran 𝐹))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 {cab 2741 ∀wral 3079 Vcvv 3455 ∖ cdif 3902 ∪ cun 3903 ∩ cin 3904 ⊆ wss 3905 ∅c0 4286 {csn 4589 ⟨cop 4595 class class class wbr 5109 dom cdm 5661 ran crn 5662 ↾ cres 5663 “ cima 5664 Fn wfn 6531 ⟶wf 6532 –1-1→wf1 6533 –1-1-onto→wf1o 6535 ‘cfv 6536 (class class class)co 7410 ≈ cen 8936 Fincfn 8939 1c1 11096 + caddc 11098 ≤ cle 11239 ♯chash 14362

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-1st 7982 df-2nd 7983 df-map 8822 df-en 8940

This theorem is referenced by: hashf1lem2 14489

W3C validator