![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1259 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj60 31429. 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.) |
Ref | Expression |
---|---|
bnj1259.1 | ⊢ 𝐵 = {𝑑 ∣ (𝑑 ⊆ 𝐴 ∧ ∀𝑥 ∈ 𝑑 pred(𝑥, 𝐴, 𝑅) ⊆ 𝑑)} |
bnj1259.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 |
bnj1259.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} |
bnj1259.4 | ⊢ 𝐷 = (dom 𝑔 ∩ dom ℎ) |
bnj1259.5 | ⊢ 𝐸 = {𝑥 ∈ 𝐷 ∣ (𝑔‘𝑥) ≠ (ℎ‘𝑥)} |
bnj1259.6 | ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷))) |
bnj1259.7 | ⊢ (𝜓 ↔ (𝜑 ∧ 𝑥 ∈ 𝐸 ∧ ∀𝑦 ∈ 𝐸 ¬ 𝑦𝑅𝑥)) |
Ref | Expression |
---|---|
bnj1259 | ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj1259.6 | . 2 ⊢ (𝜑 ↔ (𝑅 FrSe 𝐴 ∧ 𝑔 ∈ 𝐶 ∧ ℎ ∈ 𝐶 ∧ (𝑔 ↾ 𝐷) ≠ (ℎ ↾ 𝐷))) | |
2 | abid 2740 | . . . 4 ⊢ (ℎ ∈ {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))} ↔ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))) | |
3 | 2 | bnj1238 31176 | . . 3 ⊢ (ℎ ∈ {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))} → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑) |
4 | bnj1259.2 | . . . 4 ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
5 | bnj1259.3 | . . . 4 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
6 | eqid 2752 | . . . 4 ⊢ 〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉 = 〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
7 | eqid 2752 | . . . 4 ⊢ {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))} = {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))} | |
8 | 4, 5, 6, 7 | bnj1234 31380 | . . 3 ⊢ 𝐶 = {ℎ ∣ ∃𝑑 ∈ 𝐵 (ℎ Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (ℎ‘𝑥) = (𝐺‘〈𝑥, (ℎ ↾ pred(𝑥, 𝐴, 𝑅))〉))} |
9 | 3, 8 | eleq2s 2849 | . 2 ⊢ (ℎ ∈ 𝐶 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑) |
10 | 1, 9 | bnj771 31133 | 1 ⊢ (𝜑 → ∃𝑑 ∈ 𝐵 ℎ Fn 𝑑) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1072 = wceq 1624 ∈ wcel 2131 {cab 2738 ≠ wne 2924 ∀wral 3042 ∃wrex 3043 {crab 3046 ∩ cin 3706 ⊆ wss 3707 〈cop 4319 class class class wbr 4796 dom cdm 5258 ↾ cres 5260 Fn wfn 6036 ‘cfv 6041 ∧ w-bnj17 31053 predc-bnj14 31055 FrSe w-bnj15 31059 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1863 ax-4 1878 ax-5 1980 ax-6 2046 ax-7 2082 ax-9 2140 ax-10 2160 ax-11 2175 ax-12 2188 ax-13 2383 ax-ext 2732 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1074 df-tru 1627 df-ex 1846 df-nf 1851 df-sb 2039 df-clab 2739 df-cleq 2745 df-clel 2748 df-nfc 2883 df-ral 3047 df-rex 3048 df-rab 3051 df-v 3334 df-dif 3710 df-un 3712 df-in 3714 df-ss 3721 df-nul 4051 df-if 4223 df-sn 4314 df-pr 4316 df-op 4320 df-uni 4581 df-br 4797 df-opab 4857 df-rel 5265 df-cnv 5266 df-co 5267 df-dm 5268 df-res 5270 df-iota 6004 df-fun 6043 df-fn 6044 df-fv 6049 df-bnj17 31054 |
This theorem is referenced by: bnj1253 31384 bnj1286 31386 bnj1280 31387 |
Copyright terms: Public domain | W3C validator |