Theorem tz7.48-2 8477

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 3935	. . 3 ⊢ On ⊆ On
2		onelon 6402	. . . . . . . . 9 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ On)
3	2	ancoms 464	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ On) → 𝑦 ∈ On)
4		tz7.48.1	. . . . . . . . . . 11 ⊢ 𝐹 Fn On
5	4	fndmi 6662	. . . . . . . . . 10 ⊢ dom 𝐹 = On
6	5	eleq2i 2856	. . . . . . . . 9 ⊢ (𝑦 ∈ dom 𝐹 ↔ 𝑦 ∈ On)
7		fnfun 6658	. . . . . . . . . . . . 13 ⊢ (𝐹 Fn On → Fun 𝐹)
8	4, 7	ax-mp 5	. . . . . . . . . . . 12 ⊢ Fun 𝐹
9		funfvima 7256	. . . . . . . . . . . 12 ⊢ ((Fun 𝐹 ∧ 𝑦 ∈ dom 𝐹) → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥)))
10	8, 9	mpan 703	. . . . . . . . . . 11 ⊢ (𝑦 ∈ dom 𝐹 → (𝑦 ∈ 𝑥 → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥)))
11	10	impcom 413	. . . . . . . . . 10 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ dom 𝐹) → (𝐹‘𝑦) ∈ (𝐹 “ 𝑥))
12		eleq1a 2859	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑦) ∈ (𝐹 “ 𝑥) → ((𝐹‘𝑥) = (𝐹‘𝑦) → (𝐹‘𝑥) ∈ (𝐹 “ 𝑥)))
13		eldifn 4071	. . . . . . . . . . 11 ⊢ ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) ∈ (𝐹 “ 𝑥))
14	12, 13	nsyli 158	. . . . . . . . . 10 ⊢ ((𝐹‘𝑦) ∈ (𝐹 “ 𝑥) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
15	11, 14	syl 18	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
16	6, 15	sylan2br 607	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ On) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
17	3, 16	syldan 603	. . . . . . 7 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ On) → ((𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
18	17	expimpd 459	. . . . . 6 ⊢ (𝑦 ∈ 𝑥 → ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
19	18	com12 33	. . . . 5 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → (𝑦 ∈ 𝑥 → ¬ (𝐹‘𝑥) = (𝐹‘𝑦)))
20	19	ralrimiv 3157	. . . 4 ⊢ ((𝑥 ∈ On ∧ (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥))) → ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦))
21	20	ralimiaa 3102	. . 3 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → ∀𝑥 ∈ On ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦))
22	4	tz7.48lem 8475	. . 3 ⊢ ((On ⊆ On ∧ ∀𝑥 ∈ On ∀𝑦 ∈ 𝑥 ¬ (𝐹‘𝑥) = (𝐹‘𝑦)) → Fun ◡(𝐹 ↾ On))
23	1, 21, 22	sylancr 599	. 2 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → Fun ◡(𝐹 ↾ On))
24		fnrel 6660	. . . . . 6 ⊢ (𝐹 Fn On → Rel 𝐹)
25	4, 24	ax-mp 5	. . . . 5 ⊢ Rel 𝐹
26	5	eqimssi 3973	. . . . 5 ⊢ dom 𝐹 ⊆ On
27		relssres 6022	. . . . 5 ⊢ ((Rel 𝐹 ∧ dom 𝐹 ⊆ On) → (𝐹 ↾ On) = 𝐹)
28	25, 26, 27	mp2an 705	. . . 4 ⊢ (𝐹 ↾ On) = 𝐹
29	28	cnveqi 5858	. . 3 ⊢ ◡(𝐹 ↾ On) = ◡𝐹
30	29	funeqi 6577	. 2 ⊢ (Fun ◡(𝐹 ↾ On) ↔ Fun ◡𝐹)
31	23, 30	sylib 221	1 ⊢ (∀𝑥 ∈ On (𝐹‘𝑥) ∈ (𝐴 ∖ (𝐹 “ 𝑥)) → Fun ◡𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   ∖ cdif 4048  ^◡ccnv 5654  dom cdm 5655   ↾ cres 5657   “ cima 5658  Rel wrel 5660  Oncon0 6377  Fun wfun 6549   Fn wfn 6550  ‘cfv 6555

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  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-ord 6380  df-on 6381  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fv 6563

This theorem is used by:  tz7.48-3  8479  onvf1od  36034