Theorem tz7.48-2 8498

Description: Proposition 7.48(2) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.) (Revised by David Abernethy, 5-May-2013.)

Hypothesis

Ref	Expression
tz7.48.1	⊢ 𝐹 Fn On

Assertion

Ref	Expression
tz7.48-2	⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → Fun ◡𝐹)

Distinct variable group:   𝑥,𝐹

Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem tz7.48-2

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssid 4031	. . 3 ⊢ On ⊆ On
2		onelon 6420	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ On)
3	2	ancoms 458	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ On) → 𝑦 ∈ On)
4		tz7.48.1	. . . . . . . . . . 11 ⊢ 𝐹 Fn On
5	4	fndmi 6683	. . . . . . . . . 10 ⊢ dom 𝐹 = On
6	5	eleq2i 2836	. . . . . . . . 9 ⊢ (𝑦 ∈ dom 𝐹 ↔ 𝑦 ∈ On)
7		fnfun 6679	. . . . . . . . . . . . 13 ⊢ (𝐹 Fn On → Fun 𝐹)
8	4, 7	ax-mp 5	. . . . . . . . . . . 12 ⊢ Fun 𝐹
9		funfvima 7267	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥)))
10	8, 9	mpan 689	. . . . . . . . . . 11 ⊢ (𝑦 ∈ dom 𝐹 → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥)))
11	10	impcom 407	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥))
12		eleq1a 2839	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑦) ∈ (𝐹 “ 𝑥) → ((𝐹‘𝑥) = (𝐹‘𝑦) → (𝐹‘𝑥) ∈ (𝐹 “ 𝑥)))
13		eldifn 4155	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) ∈ (𝐹 “ 𝑥))
14	12, 13	nsyli 157	. . . . . . . . . 10 ⊢ ((𝐹‘𝑦) ∈ (𝐹 “ 𝑥) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
15	11, 14	syl 17	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
16	6, 15	sylan2br 594	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ On) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
17	3, 16	syldan 590	. . . . . . 7 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ On) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
18	17	expimpd 453	. . . . . 6 ⊢ (𝑦 ∈ 𝑥 → ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
19	18	com12 32	. . . . 5 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → (𝑦 ∈ 𝑥 → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
20	19	ralrimiv 3151	. . . 4 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦))
21	20	ralimiaa 3088	. . 3 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ∀𝑥 ∈ On ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦))
22	4	tz7.48lem 8497	. . 3 ⊢ ((On ⊆ On ∧ ∀𝑥 ∈ On ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦)) → Fun ◡(𝐹 ↾ On))
23	1, 21, 22	sylancr 586	. 2 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → Fun ◡(𝐹 ↾ On))
24		fnrel 6681	. . . . . 6 ⊢ (𝐹 Fn On → Rel 𝐹)
25	4, 24	ax-mp 5	. . . . 5 ⊢ Rel 𝐹
26	5	eqimssi 4069	. . . . 5 ⊢ dom 𝐹 ⊆ On
27		relssres 6051	. . . . 5 ⊢ ((Rel 𝐹 ∧ dom 𝐹 ⊆ On) → (𝐹 ↾ On) = 𝐹)
28	25, 26, 27	mp2an 691	. . . 4 ⊢ (𝐹 ↾ On) = 𝐹
29	28	cnveqi 5899	. . 3 ⊢ ◡(𝐹 ↾ On) = ◡𝐹
30	29	funeqi 6599	. 2 ⊢ (Fun ◡(𝐹 ↾ On) ↔ Fun ◡𝐹)
31	23, 30	sylib 218	1 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → Fun ◡𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2108  ∀wral 3067   ∖ cdif 3973   ⊆ wss 3976  ^◡ccnv 5699  dom cdm 5700   ↾ cres 5702   “ cima 5703  Rel wrel 5705  Oncon0 6395  Fun wfun 6567   Fn wfn 6568  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3or 1088  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-pss 3996  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-tr 5284  df-id 5593  df-eprel 5599  df-po 5607  df-so 5608  df-fr 5652  df-we 5654  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-ord 6398  df-on 6399  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-f1 6578  df-fv 6581

This theorem is referenced by:  tz7.48-3  8500