| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > frrlem7 | Structured version Visualization version GIF version | ||
| Description: Lemma for well-founded recursion. The well-founded recursion generator's domain is a subclass of 𝐴. (Contributed by Scott Fenton, 27-Aug-2022.) |
| Ref | Expression |
|---|---|
| frrlem5.1 | ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} |
| frrlem5.2 | ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) |
| Ref | Expression |
|---|---|
| frrlem7 | ⊢ dom 𝐹 ⊆ 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | frrlem5.1 | . . . . . . 7 ⊢ 𝐵 = {𝑓 ∣ ∃𝑥(𝑓 Fn 𝑥 ∧ (𝑥 ⊆ 𝐴 ∧ ∀𝑦 ∈ 𝑥 Pred(𝑅, 𝐴, 𝑦) ⊆ 𝑥) ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝑦𝐺(𝑓 ↾ Pred(𝑅, 𝐴, 𝑦))))} | |
| 2 | frrlem5.2 | . . . . . . 7 ⊢ 𝐹 = frecs(𝑅, 𝐴, 𝐺) | |
| 3 | 1, 2 | frrlem5 8269 | . . . . . 6 ⊢ 𝐹 = ∪ 𝐵 |
| 4 | 3 | dmeqi 5868 | . . . . 5 ⊢ dom 𝐹 = dom ∪ 𝐵 |
| 5 | dmuni 5878 | . . . . 5 ⊢ dom ∪ 𝐵 = ∪ 𝑔 ∈ 𝐵 dom 𝑔 | |
| 6 | 4, 5 | eqtri 2752 | . . . 4 ⊢ dom 𝐹 = ∪ 𝑔 ∈ 𝐵 dom 𝑔 |
| 7 | 6 | sseq1i 3975 | . . 3 ⊢ (dom 𝐹 ⊆ 𝐴 ↔ ∪ 𝑔 ∈ 𝐵 dom 𝑔 ⊆ 𝐴) |
| 8 | iunss 5009 | . . 3 ⊢ (∪ 𝑔 ∈ 𝐵 dom 𝑔 ⊆ 𝐴 ↔ ∀𝑔 ∈ 𝐵 dom 𝑔 ⊆ 𝐴) | |
| 9 | 7, 8 | bitri 275 | . 2 ⊢ (dom 𝐹 ⊆ 𝐴 ↔ ∀𝑔 ∈ 𝐵 dom 𝑔 ⊆ 𝐴) |
| 10 | 1 | frrlem3 8267 | . 2 ⊢ (𝑔 ∈ 𝐵 → dom 𝑔 ⊆ 𝐴) |
| 11 | 9, 10 | mprgbir 3051 | 1 ⊢ dom 𝐹 ⊆ 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∃wex 1779 {cab 2707 ∀wral 3044 ⊆ wss 3914 ∪ cuni 4871 ∪ ciun 4955 dom cdm 5638 ↾ cres 5640 Predcpred 6273 Fn wfn 6506 ‘cfv 6511 (class class class)co 7387 frecscfrecs 8259 |
| 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 2701 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-iun 4957 df-br 5108 df-opab 5170 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-iota 6464 df-fun 6513 df-fn 6514 df-fv 6519 df-ov 7390 df-frecs 8260 |
| This theorem is referenced by: frrlem14 8278 frrdmss 8286 |
| Copyright terms: Public domain | W3C validator |