![]() |
Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj518 | Structured version Visualization version GIF version |
Description: Technical lemma for bnj852 31117. 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 |
---|---|
bnj518.1 | ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) |
bnj518.2 | ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
bnj518.3 | ⊢ (𝜏 ↔ (𝜑 ∧ 𝜓 ∧ 𝑛 ∈ ω ∧ 𝑝 ∈ 𝑛)) |
Ref | Expression |
---|---|
bnj518 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → ∀𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | bnj518.3 | . . . 4 ⊢ (𝜏 ↔ (𝜑 ∧ 𝜓 ∧ 𝑛 ∈ ω ∧ 𝑝 ∈ 𝑛)) | |
2 | bnj334 30907 | . . . 4 ⊢ ((𝜑 ∧ 𝜓 ∧ 𝑛 ∈ ω ∧ 𝑝 ∈ 𝑛) ↔ (𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓 ∧ 𝑝 ∈ 𝑛)) | |
3 | 1, 2 | bitri 264 | . . 3 ⊢ (𝜏 ↔ (𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓 ∧ 𝑝 ∈ 𝑛)) |
4 | df-bnj17 30881 | . . . 4 ⊢ ((𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓 ∧ 𝑝 ∈ 𝑛) ↔ ((𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑝 ∈ 𝑛)) | |
5 | bnj518.1 | . . . . . 6 ⊢ (𝜑 ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) | |
6 | bnj518.2 | . . . . . 6 ⊢ (𝜓 ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑛 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
7 | 5, 6 | bnj517 31081 | . . . . 5 ⊢ ((𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓) → ∀𝑝 ∈ 𝑛 (𝑓‘𝑝) ⊆ 𝐴) |
8 | 7 | r19.21bi 2961 | . . . 4 ⊢ (((𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓) ∧ 𝑝 ∈ 𝑛) → (𝑓‘𝑝) ⊆ 𝐴) |
9 | 4, 8 | sylbi 207 | . . 3 ⊢ ((𝑛 ∈ ω ∧ 𝜑 ∧ 𝜓 ∧ 𝑝 ∈ 𝑛) → (𝑓‘𝑝) ⊆ 𝐴) |
10 | 3, 9 | sylbi 207 | . 2 ⊢ (𝜏 → (𝑓‘𝑝) ⊆ 𝐴) |
11 | ssel 3630 | . . . 4 ⊢ ((𝑓‘𝑝) ⊆ 𝐴 → (𝑦 ∈ (𝑓‘𝑝) → 𝑦 ∈ 𝐴)) | |
12 | bnj93 31059 | . . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑦 ∈ 𝐴) → pred(𝑦, 𝐴, 𝑅) ∈ V) | |
13 | 12 | ex 449 | . . . 4 ⊢ (𝑅 FrSe 𝐴 → (𝑦 ∈ 𝐴 → pred(𝑦, 𝐴, 𝑅) ∈ V)) |
14 | 11, 13 | sylan9r 691 | . . 3 ⊢ ((𝑅 FrSe 𝐴 ∧ (𝑓‘𝑝) ⊆ 𝐴) → (𝑦 ∈ (𝑓‘𝑝) → pred(𝑦, 𝐴, 𝑅) ∈ V)) |
15 | 14 | ralrimiv 2994 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ (𝑓‘𝑝) ⊆ 𝐴) → ∀𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
16 | 10, 15 | sylan2 490 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝜏) → ∀𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 ∧ w3a 1054 = wceq 1523 ∈ wcel 2030 ∀wral 2941 Vcvv 3231 ⊆ wss 3607 ∅c0 3948 ∪ ciun 4552 suc csuc 5763 ‘cfv 5926 ωcom 7107 ∧ w-bnj17 30880 predc-bnj14 30882 FrSe w-bnj15 30886 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 ax-un 6991 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-ral 2946 df-rex 2947 df-rab 2950 df-v 3233 df-sbc 3469 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-iun 4554 df-br 4686 df-opab 4746 df-tr 4786 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fv 5934 df-om 7108 df-bnj17 30881 df-bnj14 30883 df-bnj13 30885 df-bnj15 30887 |
This theorem is referenced by: bnj535 31086 bnj546 31092 |
Copyright terms: Public domain | W3C validator |