Users' Mathboxes Mathbox for Jonathan Ben-Naim < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bnj1498 Structured version   Visualization version   GIF version

Theorem bnj1498 35803
Description: Technical lemma for bnj60 35804. This lemma may no longer be used or have become an indirect lemma of the theorem in question (i.e. a lemma of a lemma... of the theorem). (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
bnj1498.1 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
bnj1498.2 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
bnj1498.3 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
bnj1498.4 𝐹 = ∪ 𝐶
Assertion
Ref Expression
bnj1498 (𝑅 FrSe 𝐴 → dom 𝐹 = 𝐴)
Distinct variable groups:   𝐴,𝑑,𝑓,𝑥   𝐵,𝑓   𝐺,𝑑,𝑓,𝑥   𝑅,𝑑,𝑓,𝑥
Allowed substitution hints:   𝐵(𝑥, 𝑑)   𝐶(𝑥, 𝑓, 𝑑)   𝐹(𝑥, 𝑓, 𝑑)   𝑌(𝑥, 𝑓, 𝑑)

Proof of Theorem bnj1498
Dummy variables 𝑡 𝑧 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eliun 4959 . . . . . . 7 (𝑧 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∃𝑓 ∈ 𝐶 𝑧 ∈ dom 𝑓)
2 bnj1498.3 . . . . . . . . . . . . . . . 16 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))}
32bnj1436 35581 . . . . . . . . . . . . . . 15 (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)))
43bnj1299 35560 . . . . . . . . . . . . . 14 (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 𝑓 Fn 𝑑)
5 fndm 6671 . . . . . . . . . . . . . 14 (𝑓 Fn 𝑑 → dom 𝑓 = 𝑑)
64, 5bnj31 35462 . . . . . . . . . . . . 13 (𝑓 ∈ 𝐶 → ∃𝑑 ∈ 𝐵 dom 𝑓 = 𝑑)
76bnj1196 35536 . . . . . . . . . . . 12 (𝑓 ∈ 𝐶 → ∃𝑑(𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑))
8 bnj1498.1 . . . . . . . . . . . . . . 15 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)}
98bnj1436 35581 . . . . . . . . . . . . . 14 (𝑑 ∈ 𝐵 → (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑))
109simpld 500 . . . . . . . . . . . . 13 (𝑑 ∈ 𝐵 → 𝑑 ⊆ 𝐴)
1110anim1i 627 . . . . . . . . . . . 12 ((𝑑 ∈ 𝐵 ∧ dom 𝑓 = 𝑑) → (𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑))
127, 11bnj593 35488 . . . . . . . . . . 11 (𝑓 ∈ 𝐶 → ∃𝑑(𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑))
13 sseq1 3937 . . . . . . . . . . . 12 (dom 𝑓 = 𝑑 → (dom 𝑓 ⊆ 𝐴 ↔ 𝑑 ⊆ 𝐴))
1413biimparc 485 . . . . . . . . . . 11 ((𝑑 ⊆ 𝐴 ∧ dom 𝑓 = 𝑑) → dom 𝑓 ⊆ 𝐴)
1512, 14bnj593 35488 . . . . . . . . . 10 (𝑓 ∈ 𝐶 → ∃𝑑dom 𝑓 ⊆ 𝐴)
1615bnj937 35514 . . . . . . . . 9 (𝑓 ∈ 𝐶 → dom 𝑓 ⊆ 𝐴)
1716sselda 3912 . . . . . . . 8 ((𝑓 ∈ 𝐶 ∧ 𝑧 ∈ dom 𝑓) → 𝑧 ∈ 𝐴)
1817rexlimiva 3162 . . . . . . 7 (∃𝑓 ∈ 𝐶 𝑧 ∈ dom 𝑓 → 𝑧 ∈ 𝐴)
191, 18sylbi 220 . . . . . 6 (𝑧 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 → 𝑧 ∈ 𝐴)
202bnj1317 35563 . . . . . . 7 (𝑤 ∈ 𝐶 → ∀𝑓 𝑤 ∈ 𝐶)
2120bnj1400 35577 . . . . . 6 dom ∪ 𝐶 = ∪ 𝑓 ∈ 𝐶 dom 𝑓
2219, 21eleq2s 2885 . . . . 5 (𝑧 ∈ dom ∪ 𝐶 → 𝑧 ∈ 𝐴)
23 bnj1498.4 . . . . . 6 𝐹 = ∪ 𝐶
2423dmeqi 5897 . . . . 5 dom 𝐹 = dom ∪ 𝐶
2522, 24eleq2s 2885 . . . 4 (𝑧 ∈ dom 𝐹 → 𝑧 ∈ 𝐴)
2625ssriv 3916 . . 3 dom 𝐹 ⊆ 𝐴
2726a1i 11 . 2 (𝑅 FrSe 𝐴 → dom 𝐹 ⊆ 𝐴)
28 bnj1498.2 . . . . . . . 8 𝑌 = ⟨𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))⟩
298, 28, 2bnj1493 35801 . . . . . . 7 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
30 vsnid 4624 . . . . . . . . . . 11 𝑥 ∈ {𝑥}
31 elun1 4182 . . . . . . . . . . 11 (𝑥 ∈ {𝑥} → 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)))
3230, 31ax-mp 5 . . . . . . . . . 10 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))
33 eleq2 2856 . . . . . . . . . 10 (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → (𝑥 ∈ dom 𝑓 ↔ 𝑥 ∈ ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅))))
3432, 33mpbiri 261 . . . . . . . . 9 (dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → 𝑥 ∈ dom 𝑓)
3534reximi 3107 . . . . . . . 8 (∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
3635ralimi 3106 . . . . . . 7 (∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 dom 𝑓 = ({𝑥} ∪ trCl(𝑥, 𝐴, 𝑅)) → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
3729, 36syl 18 . . . . . 6 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
38 eliun 4959 . . . . . . 7 (𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
3938ralbii 3115 . . . . . 6 (∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∀𝑥 ∈ 𝐴 ∃𝑓 ∈ 𝐶 𝑥 ∈ dom 𝑓)
4037, 39sylibr 237 . . . . 5 (𝑅 FrSe 𝐴 → ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
41 nfcv 2929 . . . . . 6 Ⅎ𝑥𝐴
428bnj1309 35764 . . . . . . . . 9 (𝑡 ∈ 𝐵 → ∀𝑥 𝑡 ∈ 𝐵)
432, 42bnj1307 35765 . . . . . . . 8 (𝑡 ∈ 𝐶 → ∀𝑥 𝑡 ∈ 𝐶)
4443nfcii 2918 . . . . . . 7 Ⅎ𝑥𝐶
45 nfcv 2929 . . . . . . 7 Ⅎ𝑥dom 𝑓
4644, 45nfiun 4986 . . . . . 6 Ⅎ𝑥∪ 𝑓 ∈ 𝐶 dom 𝑓
4741, 46dfss3f 3904 . . . . 5 (𝐴 ⊆ ∪ 𝑓 ∈ 𝐶 dom 𝑓 ↔ ∀𝑥 ∈ 𝐴 𝑥 ∈ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
4840, 47sylibr 237 . . . 4 (𝑅 FrSe 𝐴 → 𝐴 ⊆ ∪ 𝑓 ∈ 𝐶 dom 𝑓)
4948, 21sseqtrrdi 3953 . . 3 (𝑅 FrSe 𝐴 → 𝐴 ⊆ dom ∪ 𝐶)
5049, 24sseqtrrdi 3953 . 2 (𝑅 FrSe 𝐴 → 𝐴 ⊆ dom 𝐹)
5127, 50eqssd 3929 1 (𝑅 FrSe 𝐴 → dom 𝐹 = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1572   ∈ wcel 2150  {cab 2744  ∀wral 3083  ∃wrex 3093   ⊆ wss 3899   ∪ cun 4151  {csn 4587  ⟨cop 4839  ∪ cuni 4871  ∪ ciun 4955  dom cdm 5657   ↾ cres 5659   Fn wfn 6560  ‘cfv 6565   predc-bnj14 35431   FrSe w-bnj15 35435   trClc-bnj18 35437
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782  ax-reg 9622  ax-inf2 9678
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-om 7911  df-1o 8513  df-bnj17 35430  df-bnj14 35432  df-bnj13 35434  df-bnj15 35436  df-bnj18 35438  df-bnj19 35440
This theorem is used by:  bnj60  35804
  Copyright terms: Public domain W3C validator