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

Theorem tz7.48-1 8402
Description: Proposition 7.48(1) of [TakeutiZaring] p. 51. (Contributed by NM, 9-Feb-1997.)
Hypothesis
Ref Expression
tz7.48.1 𝐹 Fn On
Assertion
Ref Expression
tz7.48-1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem tz7.48-1
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 vex 3452 . . . . 5 𝑦 ∈ V
21elrn2 5861 . . . 4 (𝑦 ∈ ran 𝐹 ↔ ∃𝑥𝑥, 𝑦⟩ ∈ 𝐹)
3 vex 3452 . . . . . . . . 9 𝑥 ∈ V
43, 1opeldm 5876 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ dom 𝐹)
5 tz7.48.1 . . . . . . . . 9 𝐹 Fn On
65fndmi 6614 . . . . . . . 8 dom 𝐹 = On
74, 6eleqtrdi 2866 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ 𝐹𝑥 ∈ On)
87ancri 556 . . . . . 6 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9 fnopfvb 6907 . . . . . . . 8 ((𝐹 Fn On ∧ 𝑥 ∈ On) → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
105, 9mpan 698 . . . . . . 7 (𝑥 ∈ On → ((𝐹𝑥) = 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
1110pm5.32i 581 . . . . . 6 ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) ↔ (𝑥 ∈ On ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
128, 11sylibr 236 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ 𝐹 → (𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
1312eximi 1849 . . . 4 (∃𝑥𝑥, 𝑦⟩ ∈ 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
142, 13sylbi 219 . . 3 (𝑦 ∈ ran 𝐹 → ∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦))
15 nfra1 3280 . . . 4 𝑥𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))
16 nfv 1928 . . . 4 𝑥 𝑦𝐴
17 rsp 3244 . . . . 5 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))))
18 eldifi 4079 . . . . . . . 8 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝐹𝑥) ∈ 𝐴)
19 eleq1 2844 . . . . . . . 8 ((𝐹𝑥) = 𝑦 → ((𝐹𝑥) ∈ 𝐴𝑦𝐴))
2018, 19syl5ibcom 247 . . . . . . 7 ((𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝐹𝑥) = 𝑦𝑦𝐴))
2120imim2i 16 . . . . . 6 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → (𝑥 ∈ On → ((𝐹𝑥) = 𝑦𝑦𝐴)))
2221impd 413 . . . . 5 ((𝑥 ∈ On → (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥))) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2317, 22syl 17 . . . 4 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ((𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2415, 16, 23exlimd 2247 . . 3 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (∃𝑥(𝑥 ∈ On ∧ (𝐹𝑥) = 𝑦) → 𝑦𝐴))
2514, 24syl5 34 . 2 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → (𝑦 ∈ ran 𝐹𝑦𝐴))
2625ssrdv 3937 1 (∀𝑥 ∈ On (𝐹𝑥) ∈ (𝐴 ∖ (𝐹𝑥)) → ran 𝐹𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1554  wex 1793  wcel 2136  wral 3070  cdif 3896  wss 3899  cop 4582  dom cdm 5640  ran crn 5641  cima 5643  Oncon0 6335   Fn wfn 6505  cfv 6510
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-10 2169  ax-12 2206  ax-ext 2728  ax-sep 5240  ax-nul 5250  ax-pr 5384
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-nf 1798  df-sb 2085  df-mo 2560  df-eu 2590  df-clab 2735  df-cleq 2748  df-clel 2831  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5095  df-opab 5157  df-id 5535  df-xp 5646  df-rel 5647  df-cnv 5648  df-co 5649  df-dm 5650  df-rn 5651  df-iota 6466  df-fun 6512  df-fn 6513  df-fv 6518
This theorem is referenced by:  tz7.48-3  8403
  Copyright terms: Public domain W3C validator