|   | Mathbox for Jonathan Ben-Naim | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > Mathboxes > bnj1234 | Structured version Visualization version GIF version | ||
| Description: Technical lemma for bnj60 35076. 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 | 
|---|---|
| bnj1234.2 | ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | 
| bnj1234.3 | ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | 
| bnj1234.4 | ⊢ 𝑍 = 〈𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))〉 | 
| bnj1234.5 | ⊢ 𝐷 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))} | 
| Ref | Expression | 
|---|---|
| bnj1234 | ⊢ 𝐶 = 𝐷 | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | fneq1 6659 | . . . . 5 ⊢ (𝑓 = 𝑔 → (𝑓 Fn 𝑑 ↔ 𝑔 Fn 𝑑)) | |
| 2 | fveq1 6905 | . . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝑓‘𝑥) = (𝑔‘𝑥)) | |
| 3 | reseq1 5991 | . . . . . . . . . 10 ⊢ (𝑓 = 𝑔 → (𝑓 ↾ pred(𝑥, 𝐴, 𝑅)) = (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))) | |
| 4 | 3 | opeq2d 4880 | . . . . . . . . 9 ⊢ (𝑓 = 𝑔 → 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 = 〈𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))〉) | 
| 5 | bnj1234.2 | . . . . . . . . 9 ⊢ 𝑌 = 〈𝑥, (𝑓 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
| 6 | bnj1234.4 | . . . . . . . . 9 ⊢ 𝑍 = 〈𝑥, (𝑔 ↾ pred(𝑥, 𝐴, 𝑅))〉 | |
| 7 | 4, 5, 6 | 3eqtr4g 2802 | . . . . . . . 8 ⊢ (𝑓 = 𝑔 → 𝑌 = 𝑍) | 
| 8 | 7 | fveq2d 6910 | . . . . . . 7 ⊢ (𝑓 = 𝑔 → (𝐺‘𝑌) = (𝐺‘𝑍)) | 
| 9 | 2, 8 | eqeq12d 2753 | . . . . . 6 ⊢ (𝑓 = 𝑔 → ((𝑓‘𝑥) = (𝐺‘𝑌) ↔ (𝑔‘𝑥) = (𝐺‘𝑍))) | 
| 10 | 9 | ralbidv 3178 | . . . . 5 ⊢ (𝑓 = 𝑔 → (∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌) ↔ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))) | 
| 11 | 1, 10 | anbi12d 632 | . . . 4 ⊢ (𝑓 = 𝑔 → ((𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))) | 
| 12 | 11 | rexbidv 3179 | . . 3 ⊢ (𝑓 = 𝑔 → (∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌)) ↔ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍)))) | 
| 13 | 12 | cbvabv 2812 | . 2 ⊢ {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))} | 
| 14 | bnj1234.3 | . 2 ⊢ 𝐶 = {𝑓 ∣ ∃𝑑 ∈ 𝐵 (𝑓 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑓‘𝑥) = (𝐺‘𝑌))} | |
| 15 | bnj1234.5 | . 2 ⊢ 𝐷 = {𝑔 ∣ ∃𝑑 ∈ 𝐵 (𝑔 Fn 𝑑 ∧ ∀𝑥 ∈ 𝑑 (𝑔‘𝑥) = (𝐺‘𝑍))} | |
| 16 | 13, 14, 15 | 3eqtr4i 2775 | 1 ⊢ 𝐶 = 𝐷 | 
| Colors of variables: wff setvar class | 
| Syntax hints: ∧ wa 395 = wceq 1540 {cab 2714 ∀wral 3061 ∃wrex 3070 〈cop 4632 ↾ cres 5687 Fn wfn 6556 ‘cfv 6561 predc-bnj14 34702 | 
| 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 2007 ax-8 2110 ax-9 2118 ax-ext 2708 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2065 df-clab 2715 df-cleq 2729 df-clel 2816 df-ral 3062 df-rex 3071 df-rab 3437 df-v 3482 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-br 5144 df-opab 5206 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-res 5697 df-iota 6514 df-fun 6563 df-fn 6564 df-fv 6569 | 
| This theorem is referenced by: bnj1245 35028 bnj1256 35029 bnj1259 35030 bnj1296 35035 bnj1311 35038 | 
| Copyright terms: Public domain | W3C validator |