MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  tz7.48-2 Structured version   Visualization version   GIF version

Theorem tz7.48-2 8375
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.
StepHypRef Expression
1 ssid 3939 . . 3 On ⊆ On
2 onelon 6339 . . . . . . . . 9 ((𝑥 ∈ On ∧ 𝑦𝑥) → 𝑦 ∈ On)
32ancoms 460 . . . . . . . 8 ((𝑦𝑥𝑥 ∈ On) → 𝑦 ∈ On)
4 tz7.48.1 . . . . . . . . . . 11 𝐹 Fn On
54fndmi 6593 . . . . . . . . . 10 dom 𝐹 = On
65eleq2i 2833 . . . . . . . . 9 (𝑦 ∈ dom 𝐹𝑦 ∈ On)
7 fnfun 6589 . . . . . . . . . . . . 13 (𝐹 Fn On → Fun 𝐹)
84, 7ax-mp 5 . . . . . . . . . . . 12 Fun 𝐹
9 funfvima 7178 . . . . . . . . . . . 12 ((Fun 𝐹𝑦 ∈ dom 𝐹) → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
108, 9mpan 697 . . . . . . . . . . 11 (𝑦 ∈ dom 𝐹 → (𝑦𝑥 → (𝐹𝑦) ∈ (𝐹𝑥)))
1110impcom 409 . . . . . . . . . 10 ((𝑦𝑥𝑦 ∈ dom 𝐹) → (𝐹𝑦) ∈ (𝐹𝑥))
12 eleq1a 2836 . . . . . . . . . . 11 ((𝐹𝑦) ∈ (𝐹𝑥) → ((𝐹𝑥) = (𝐹𝑦) → (𝐹𝑥) ∈ (𝐹𝑥)))
13 eldifn 4065 . . . . . . . . . . 11 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) ∈ (𝐹𝑥))
1412, 13nsyli 157 . . . . . . . . . 10 ((𝐹𝑦) ∈ (𝐹𝑥) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1511, 14syl 17 . . . . . . . . 9 ((𝑦𝑥𝑦 ∈ dom 𝐹) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
166, 15sylan2br 602 . . . . . . . 8 ((𝑦𝑥𝑦 ∈ On) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
173, 16syldan 598 . . . . . . 7 ((𝑦𝑥𝑥 ∈ On) → ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1817expimpd 455 . . . . . 6 (𝑦𝑥 → ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ¬ (𝐹𝑥) = (𝐹𝑦)))
1918com12 32 . . . . 5 ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑦𝑥 → ¬ (𝐹𝑥) = (𝐹𝑦)))
2019ralrimiv 3132 . . . 4 ((𝑥 ∈ On ∧ (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
2120ralimiaa 3077 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦))
224tz7.48lem 8374 . . 3 ((On ⊆ On ∧ ∀𝑥 ∈ On ∀𝑦𝑥 ¬ (𝐹𝑥) = (𝐹𝑦)) → Fun (𝐹 ↾ On))
231, 21, 22sylancr 594 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun (𝐹 ↾ On))
24 fnrel 6591 . . . . . 6 (𝐹 Fn On → Rel 𝐹)
254, 24ax-mp 5 . . . . 5 Rel 𝐹
265eqimssi 3977 . . . . 5 dom 𝐹 ⊆ On
27 relssres 5981 . . . . 5 ((Rel 𝐹 ∧ dom 𝐹 ⊆ On) → (𝐹 ↾ On) = 𝐹)
2825, 26, 27mp2an 699 . . . 4 (𝐹 ↾ On) = 𝐹
2928cnveqi 5819 . . 3 (𝐹 ↾ On) = 𝐹
3029funeqi 6510 . 2 (Fun (𝐹 ↾ On) ↔ Fun 𝐹)
3123, 30sylib 220 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → Fun 𝐹)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 397   = wceq 1548  wcel 2121  wral 3055  cdif 3882  wss 3885  ccnv 5620  dom cdm 5621  cres 5623  cima 5624  Rel wrel 5626  Oncon0 6314  Fun wfun 6483   Fn wfn 6484  cfv 6489
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-ne 2937  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-ord 6317  df-on 6318  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fv 6497
This theorem is referenced by:  tz7.48-3  8377  onvf1od  35350
  Copyright terms: Public domain W3C validator