Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfr1onlemssrecs | GIF version |
Description: Lemma for tfr1on 6318. The union of functions acceptable for tfr1on 6318 is a subset of recs. (Contributed by Jim Kingdon, 15-Mar-2022.) |
Ref | Expression |
---|---|
tfr1onlemssrecs.1 | ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} |
tfr1onlemssrecs.x | ⊢ (𝜑 → Ord 𝑋) |
Ref | Expression |
---|---|
tfr1onlemssrecs | ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfr1onlemssrecs.1 | . . . 4 ⊢ 𝐴 = {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} | |
2 | tfr1onlemssrecs.x | . . . . . 6 ⊢ (𝜑 → Ord 𝑋) | |
3 | ordsson 4469 | . . . . . 6 ⊢ (Ord 𝑋 → 𝑋 ⊆ On) | |
4 | ssrexv 3207 | . . . . . 6 ⊢ (𝑋 ⊆ On → (∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))))) | |
5 | 2, 3, 4 | 3syl 17 | . . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))) → ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦))))) |
6 | 5 | ss2abdv 3215 | . . . 4 ⊢ (𝜑 → {𝑓 ∣ ∃𝑥 ∈ 𝑋 (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}) |
7 | 1, 6 | eqsstrid 3188 | . . 3 ⊢ (𝜑 → 𝐴 ⊆ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}) |
8 | 7 | unissd 3813 | . 2 ⊢ (𝜑 → ∪ 𝐴 ⊆ ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))}) |
9 | df-recs 6273 | . 2 ⊢ recs(𝐺) = ∪ {𝑓 ∣ ∃𝑥 ∈ On (𝑓 Fn 𝑥 ∧ ∀𝑦 ∈ 𝑥 (𝑓‘𝑦) = (𝐺‘(𝑓 ↾ 𝑦)))} | |
10 | 8, 9 | sseqtrrdi 3191 | 1 ⊢ (𝜑 → ∪ 𝐴 ⊆ recs(𝐺)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 {cab 2151 ∀wral 2444 ∃wrex 2445 ⊆ wss 3116 ∪ cuni 3789 Ord word 4340 Oncon0 4341 ↾ cres 4606 Fn wfn 5183 ‘cfv 5188 recscrecs 6272 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-in 3122 df-ss 3129 df-uni 3790 df-tr 4081 df-iord 4344 df-on 4346 df-recs 6273 |
This theorem is referenced by: tfr1onlembfn 6312 tfr1onlemubacc 6314 tfr1onlemres 6317 |
Copyright terms: Public domain | W3C validator |