| Mathbox for Jonathan Ben-Naim |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj938 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj69 35007. 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 |
|---|---|
| bnj938.1 | ⊢ 𝐷 = (ω ∖ {∅}) |
| bnj938.2 | ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) |
| bnj938.3 | ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) |
| bnj938.4 | ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) |
| bnj938.5 | ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) |
| Ref | Expression |
|---|---|
| bnj938 | ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elisset 2811 | . . 3 ⊢ (𝑋 ∈ 𝐴 → ∃𝑥 𝑥 = 𝑋) | |
| 2 | 1 | bnj706 34751 | . 2 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∃𝑥 𝑥 = 𝑋) |
| 3 | bnj291 34708 | . . . . . 6 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) ↔ ((𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎) ∧ 𝑋 ∈ 𝐴)) | |
| 4 | 3 | simplbi 497 | . . . . 5 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎)) |
| 5 | bnj602 34912 | . . . . . . . . . 10 ⊢ (𝑥 = 𝑋 → pred(𝑥, 𝐴, 𝑅) = pred(𝑋, 𝐴, 𝑅)) | |
| 6 | 5 | eqeq2d 2741 | . . . . . . . . 9 ⊢ (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅))) |
| 7 | bnj938.4 | . . . . . . . . 9 ⊢ (𝜑′ ↔ (𝑓‘∅) = pred(𝑋, 𝐴, 𝑅)) | |
| 8 | 6, 7 | bitr4di 289 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ 𝜑′)) |
| 9 | 8 | 3anbi2d 1443 | . . . . . . 7 ⊢ (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′))) |
| 10 | bnj938.2 | . . . . . . 7 ⊢ (𝜏 ↔ (𝑓 Fn 𝑚 ∧ 𝜑′ ∧ 𝜓′)) | |
| 11 | 9, 10 | bitr4di 289 | . . . . . 6 ⊢ (𝑥 = 𝑋 → ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ 𝜏)) |
| 12 | 11 | 3anbi2d 1443 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) ↔ (𝑅 FrSe 𝐴 ∧ 𝜏 ∧ 𝜎))) |
| 13 | 4, 12 | imbitrrid 246 | . . . 4 ⊢ (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → (𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎))) |
| 14 | bnj938.1 | . . . . 5 ⊢ 𝐷 = (ω ∖ {∅}) | |
| 15 | biid 261 | . . . . 5 ⊢ ((𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ↔ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′)) | |
| 16 | bnj938.3 | . . . . 5 ⊢ (𝜎 ↔ (𝑚 ∈ 𝐷 ∧ 𝑛 = suc 𝑚 ∧ 𝑝 ∈ 𝑚)) | |
| 17 | biid 261 | . . . . 5 ⊢ ((𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ↔ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅)) | |
| 18 | bnj938.5 | . . . . 5 ⊢ (𝜓′ ↔ ∀𝑖 ∈ ω (suc 𝑖 ∈ 𝑚 → (𝑓‘suc 𝑖) = ∪ 𝑦 ∈ (𝑓‘𝑖) pred(𝑦, 𝐴, 𝑅))) | |
| 19 | 14, 15, 16, 17, 18 | bnj546 34893 | . . . 4 ⊢ ((𝑅 FrSe 𝐴 ∧ (𝑓 Fn 𝑚 ∧ (𝑓‘∅) = pred(𝑥, 𝐴, 𝑅) ∧ 𝜓′) ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
| 20 | 13, 19 | syl6 35 | . . 3 ⊢ (𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)) |
| 21 | 20 | exlimiv 1930 | . 2 ⊢ (∃𝑥 𝑥 = 𝑋 → ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V)) |
| 22 | 2, 21 | mpcom 38 | 1 ⊢ ((𝑅 FrSe 𝐴 ∧ 𝑋 ∈ 𝐴 ∧ 𝜏 ∧ 𝜎) → ∪ 𝑦 ∈ (𝑓‘𝑝) pred(𝑦, 𝐴, 𝑅) ∈ V) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2109 ∀wral 3045 Vcvv 3450 ∖ cdif 3914 ∅c0 4299 {csn 4592 ∪ ciun 4958 suc csuc 6337 Fn wfn 6509 ‘cfv 6514 ωcom 7845 ∧ w-bnj17 34683 predc-bnj14 34685 FrSe w-bnj15 34689 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-tr 5218 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fv 6522 df-om 7846 df-bnj17 34684 df-bnj14 34686 df-bnj13 34688 df-bnj15 34690 |
| This theorem is referenced by: bnj944 34935 bnj969 34943 |
| Copyright terms: Public domain | W3C validator |